English: Main steps of the Bhandari's shortest pair of edge-disjoint paths algorithm illustrated sequentially in six figures: A) Given undirected graph G(V, E) with edge weights B) Shortest path ABCZ from A to Z (in bold lines) C) Reversal of arcs of the shortest path and making their weights negative. D) Shortest path ADCBZ (bold lines) in the new transformed graph of figure C (this may be determined using a modified form of Dijklstra algorithm valid for such negative arcs; note there are no negative cycles). E) Shortest path ADCBZ in the original graph F) Shortest pair of edge-disjoint paths (ABZ, ADCZ) found after erasing the edge BC common to paths ABCZ (figure B) and ADCBZ (figure E), and grouping the remaining edges suitably.