Two graph algorithms which derive from bread-first search were implemented by using C language in this paper. One algorithm is a replacement method for finding out a graph's all spanning tree, the other is the Pat...
详细信息
Two graph algorithms which derive from bread-first search were implemented by using C language in this paper. One algorithm is a replacement method for finding out a graph's all spanning tree, the other is the paton algorithm for finding out all essential circuit of a graph. This paper mainly introduced the flow of the two graph algorithms. An illustrative example was presented. Also, a practical operational platform of graph algorithm was designed and realized in this paper.
暂无评论