[3768] DSE: Add support for multiple shortest paths
Use Eppstein's algorithm for finding k shortest paths between two vertices in a graph instead of Johnson's algorithm in order to extract all routes of equal weight.
Edited by Tiziano Munaro
Use Eppstein's algorithm for finding k shortest paths between two vertices in a graph instead of Johnson's algorithm in order to extract all routes of equal weight.