Articulation Points or Cut Vertices in a Graph | Everything Under The Sun
A vertex in an undirected connected graph is an articulation point (or cut vertex) iff removing it (and edges through it) disconnects the graph. It can be thought of as a single point of failure. Any graph that contains an articulation point is inherently fragile because deleting that single vertex causes a loss of connectivity between other nodes. If a graph does not have an articulation point, then it is said to be biconnected.
Read full article from Articulation Points or Cut Vertices in a Graph | Everything Under The Sun
No comments:
Post a Comment