图论算法复杂性问题(一)

本文论述了图论算法复杂性的基本理论和分析方法。由它的表示式和阶的运算,可以分析一个具体问题的算法复杂性,进而明确某一具体算法的有效性。

Some probems of Graph Theory Algorithmic Complexity

In this paper we introduce the basic language of Graph theory algorithmic Complexity. Our interest in efficiency is particularly concerned with what is called the time-complexity of algorithms. The complexity of an algorithm is Simply the number of computational steps that it takes to transform the input data to the result of a computation. Generally this is a function of the quantity of the input data, Commonly called the problem Size. For Graph algorithms the problem Size is determined by one or perhaps both of the Variables n and |E|.