摘要
提出了一个基于DFS的图双向连通性研究的简单算法,本算法具有容易理解、形式规范的特点,无论用于教学还是解决实际问题,都有较大的实用价值。
The algorithm of finding articulation point of connected graph had been given in the article. There are many good characters with the algorithm, such as easy understanding and standard form. It is worthy not only at teaching but also at practice.
出处
《科技广场》
2007年第5期55-56,共2页
Science Mosaic
关键词
DFS生成树
关节点
双向连通图
深度优先搜索
DFS Spanning Tree
Articulation Point
Biconnected Graph
DFS（Depth-first Search）
