An articulation point in a graph is a vertex, whose removal will disconnect the graph (or its component). This example uses the extended DepthFirstSearch method to compute articulation points of a graph. (Refer to Sedgewick. ) Each vertex is given an index in traversal order. For each vertex, we compute the least index reachable by going downwards in the DFS tree and then following a s
()
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected