ALL SHORTEST ROUTES IN A GRAPH
STANFORD UNIV CA OPERATIONS RESEARCH HOUSE
Pagination or Media Count:
An inductive procedure on nodes is given that requires nn-1n-2 comparison - addition operations to determine minimum routes between all nodes of a directed network. Arc distances may be negative. If negative cycles exist, however, termination will occur when one such is found.
- Operations Research