All shortest distances in a graph. An improvement to Dantzig's inductive algorithm.

Published in: Discret. Math. (1973)

Keyphrases

finding the shortest path
shortest path
dynamic programming
shortest path problem
weighted graph
detection algorithm
distance matrix
path length
spanning tree
graph model
neural network
np hard
cost function
significant improvement
search space
preprocessing
optimal solution
learning algorithm