在简单无向图中查找所有割边的算法  

The algorithm of find all cut-edge of a simple undirected graph

作　　者：边辰通[1] 

机构地区：[1]北京科技大学机械工程学院,北京海淀100083

出　　处：《中国科技信息》2013年第3期54-55,共2页China Science and Technology Information

摘　　要：在CAD软件的尺寸驱动功能中,可以把一部分尺寸关系用简单无向图的形式处理。需要在简单无向图中找到所有的割边。针对这种需求提出了查找找无向连通图中所有割边的算法,并提出了相关的概念,其中也实现了对于简单无向图中圈的查找算法。经实际操作,算法可以识别图中所有的割边,为以后的使用图的分析打下了基础。In the dimension drive of CAD,the relationship of the geometrical figure could be processed as undirected graph.And all the cut-edges should be found in the graph.In response to this demand,the algorithm of find all cut-edge of simple undirected graph and concepts related were proposed,including the algorithm of find cycle of a simple undirected graph.The algorithm could found all cut-edge after test,and lay a foundation of further research of the graph.

关 键 词：图 割边 圈 算法 

分 类 号：O157.5[理学—数学]