A new algorithm to find the shortest paths between all pairs of nodes.
Giorgio GalloStefano PallottinoPublished in: Discret. Appl. Math. (1982)
Keyphrases
- shortest path
- shortest path problem
- finding the shortest path
- path length
- shortest path algorithm
- optimal solution
- optimal path
- np hard
- minimum cost flow
- graph structure
- dijkstra algorithm
- similarity measure
- weighted graph
- dynamic programming
- geodesic distance
- edge weights
- simulated annealing
- distance transformation
- shortest distance
- strongly connected components