⬅ Previous Topic
Bridges in Graph using Tarjan's AlgorithmGraph (Adjacency List) | Articulation Points | Description |
---|---|---|
{0:[1,2], 1:[0,2], 2:[0,1,3], 3:[2,4,5], 4:[3], 5:[3]} | [2,3] | Removing node 2 or 3 disconnects parts of the graph |
{0:[1], 1:[0,2], 2:[1,3], 3:[2]} | [1,2] | Removing nodes 1 or 2 disconnects the chain |
{0:[1,2], 1:[0], 2:[0]} | [0] | Node 0 connects two leaf nodes |
{0:[1], 1:[0]} | [] | Two nodes connected by a single edge, neither is an articulation point |
{0:[1,2], 1:[0,2], 2:[0,1]} | [] | Triangle graph, fully connected — no articulation points |