Given an undirectional graph, how would you be able to efficiently find all of its "bottleneck" paths?
A "bottleneck" path is defined as a path that if destroyed, causes the graph to split into 2 non-connected graphs.
Algorithm for finding bottleneck paths in an undirectional graph.
Could not find such algorithm.
>Solution :
I’m not sure if this is exactly what you are looking for, but as a sub-problem, you can consider points in the graph such that if you remove the point it separates the graph into two or more connected subgraphs. These are called "cut vertices". Tarjan’s algorithm is an algorithm for finding them.