## 算法：无向图的割点、桥与双连通分量

概念 对于无向图\(G\)，删除顶点\(v\)和其相连的边后\(G\)所包含的连通分量增多，则称\(v\)为关节点 (articulation point) 或割点 (cut

## Algorithm: Breadth-First Search

Recall: Graphs Graph \(G = (V,E)\) \(V\) = set of vertices (arbitrary labels) \(E\) = set of

A collection of 2 Articles

概念 对于无向图\(G\)，删除顶点\(v\)和其相连的边后\(G\)所包含的连通分量增多，则称\(v\)为关节点 (articulation point) 或割点 (cut

Recall: Graphs Graph \(G = (V,E)\) \(V\) = set of vertices (arbitrary labels) \(E\) = set of