e/Edge disjoint shortest pair algorithm

Information
has gloss	eng: Edge disjoint shortest pair algorithm is an algorithm in computer network routing. The algorithm is used for generating the shortest pair of edge disjoint paths between a given pair of vertices as follows:
lexicalization	eng: Edge Disjoint Shortest Pair Algorithm
instance of	c/Routing algorithms