Dank: Created page with "An algorithm to find two paths in a nonnegatively-weighted directed graph, such that the two paths connect the same vertices, are otherwise disjoint, and minimize path lenghts..."

2012-08-13T17:07:49Z

Created page with "An algorithm to find two paths in a nonnegatively-weighted directed graph, such that the two paths connect the same vertices, are otherwise disjoint, and minimize path lenghts..."

New page

An algorithm to find two paths in a nonnegatively-weighted directed graph, such that the two paths connect the same vertices, are otherwise disjoint, and minimize path lenghts. There exist obvious applications to routing survivability and network flow. The algorithm involves running [[Dijkstra's Algorithm|Dijkstra]] twice.

[[CATEGORY: Computer Science Eponyms]]

Suurballe's Algorithm - revision history

Dank: Created page with "An algorithm to find two paths in a nonnegatively-weighted directed graph, such that the two paths connect the same vertices, are otherwise disjoint, and minimize path lenghts..."