摘要
在研究有向图中全部简单回路现有算法的基础上,综合各算法的优点提出一种新的算法。算法的主要思想是对图中顶点进行深度优先搜索,在搜索过程中采取措施避免同一回路的重复出现,同时记录有用信息避免对顶点的重复访问,从而提高算法的效率,还给出了算法的证明和实例应用。算法结构清晰简单,方便转化为计算机程序。
Based on studying existing algorithms with regard to all elementary circuits in directed graph, a new ＇algorithm is proposed by integrating the advantages of these algorithms. The main thought of it is the depth-first search of vertex in graph with special measure taken to insure no circuit is repeatedly found during the searching process, meanwhile some available information is recorded fbr avoiding duplicated visits to same vertex, in this way it improves the efficiency of the algorithm. The proof of the algorithm and its application are given as well. It is convenient to transform this algorithm to a computer program,for its structure is clear and simple.
出处
《计算机应用与软件》
CSCD
2009年第12期27-29,33,共4页
Computer Applications and Software
基金
国家自然科学基金项目(60473063)
关键词
有向图
简单有向回路
深度优先搜索
算法
Directed graph Elementary directional circuit Depth-first search Algorithm
作者简介
王玉英，副教授，主研领域：逆向工程，面向对象技术和软件体系结构
