简单图中回路问题的求解  

Circuit searching in simple graph

作　　者：王炯[1] 

机构地区：[1]合肥工业大学计算机与信息学院,安徽合肥230009

出　　处：《合肥工业大学学报（自然科学版）》2001年第3期438-441,共4页Journal of Hefei University of Technology：Natural Science

摘　　要：回路是图论中一个重要的概念 ,在软件设计中也有广泛的应用。文章对简单图中回路的搜索问题进行了详细的讨论 ,在原有针对结点的遍历算法基础上构造出适用于路径搜索的算法 ,并着重分析了在无向图中简化搜索路径、提高算法效率的问题 。Circuit is a very important concept in graph theory and has been extensively applied in software design. This paper discusses the general solution to searching of all the different circuits in simple graph based on the depth first search. The paper focuses attention on how to simplify the searching and enhance the effectiveness of the program in an undirected simple graph.

关 键 词：顶点 路径 回路 深度优先搜索 简单图 算法 

分 类 号：O157.5[理学—数学] TP301.6[理学—基础数学]