【摘要】 用C语言实现了2种由广度优先思想衍生出的图论算法,它们分别是求出全部生成树的置换法和找出图中所有基本回路的Paton算法。本文重点叙述了这2种算法的流程,给出了相应算例,并设计实现了一种实用的图论算法操作界面。更多还原

【Abstract】 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.更多还原