Is anyone aware of an algorithm to determine which vertices/edges would disconnect an undirected graph if removed? For all vertices/edges.
Of course I could run a BFS for each vertex and for each edge to test if the remaining graph would be connected. But is there anything more efficient?
In the end I would like to uniformly draw a vertex/edge out of those that would not disconnect the graph, to make simulations for fail-over routing in a computer network.