On the decision algorithm of the unordered depth first spanning trees of an undirected graph
Jun Yu · Journal of Longdong University · 2006
As a very important decision algorithm in graph theory, the optimization of the algorithm of depth first search tree will give an advantage to dealing with algorithm of other graph theory efficiently. So far as the decision algorithm of depth first search trees is concerned, this paper puts forward the notion from the giving of criterion to the design of serial algorithm, and to the parallel algorithm by using Euler, so as to get a better algorithm with low cost.