# What algorithm can I use to locate bottleneck paths in an undirected graph?

Advertisements 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… Read More What algorithm can I use to locate bottleneck paths in an undirected graph?