Edge disjoint shortest pair algorithm
= Edge disjoint shortest pair algorithm
{wiki=Edge_disjoint_shortest_pair_algorithm}
The Edge Disjoint Shortest Pair algorithm refers to a method used in graph theory to find pairs of shortest paths in a graph such that the two paths do not share any edges. This problem is relevant in various applications such as network routing, transportation, and flow networks.