Edge disjoint shortest pair algorithm
id:
edge-disjoint-shortest-pair-algorithm-312-16357541
title:
Edge disjoint shortest pair algorithm
text:
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. For an undirected graph G(V, E), it is stated as follows: Run the shortest path algorithm for the given pair of vertices
Replace each edge of the shortest path by a single arc directed towards the source vertex
Make the length of each of the above arcs negative
Run the shortest path algorithm (Note: the
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Edge_disjoint_shortest_pair_algorithm
date created:
date modified:
2024-03-31T21:18:51Z
main entity:
{"identifier":"Q5337697","url":"https://www.wikidata.org/entity/Q5337697"}
image:
fields total:
13
integrity:
13