期刊名称：International Journal of Education and Management Engineering(IJEME)
印刷版ISSN：2305-3623
电子版ISSN：2305-8463
出版年度：2012
卷号：2
期号：1
页码：9-15
出版社：MECS Publisher
摘要：In this paper a simple method is proposed to determine whether a graph is edge-connected. This method may calculate the minimum pre-order number of each vertex by back edge for the depth-first search spanning tree, and then find out the bridges in the graph. Finally, it may determine whether the graph is edge-connected. The best nature of method is to understand and hold the algorithm easily. It can help teaching improvement and practice application. It is also worth popularization.
Loading...
