Check out my first novel, midnight's simulacra!
Suurballe's Algorithm: Difference between revisions
Jump to navigation
Jump to search
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..." |
(No difference)
|
Latest revision as of 17:07, 13 August 2012
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 twice.