Suurballe's algorithm
id:
suurballe-s-algorithm-254-10104405
title:
Suurballe's algorithm
text:
In theoretical computer science and network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length. The algorithm was conceived by John W. Suurballe and published in 1974. The main idea of Suurballe's algorithm is to use Dijkstra's algorithm to find one path, to modify the weights of the graph edges, and then to run Dijkstra's algorithm a second ti
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for two disjoint paths in a graph
original url:
https://en.wikipedia.org/wiki/Suurballe%27s_algorithm
date created:
date modified:
2022-05-04T17:03:16Z
main entity:
{"identifier":"Q7650417","url":"https://www.wikidata.org/entity/Q7650417"}
image:
fields total:
13
integrity:
14