基于DFS的图的双向连通性研究  

Research and Implementation of Finding Articulation Point Based on DFS

作　　者：徐翠霞[1] 

机构地区：[1]潍坊学院计算机与通信工程学院,潍坊261061

出　　处：《科技广场》2007年第5期55-56,共2页Science Mosaic

摘　　要：提出了一个基于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.

关 键 词：DFS生成树 关节点 双向连通图 深度优先搜索 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]