Accession Number:

AD0646551

Title:

ALL SHORTEST ROUTES IN A GRAPH

Descriptive Note:

Technical rept.

Corporate Author:

STANFORD UNIV CA OPERATIONS RESEARCH HOUSE

Personal Author(s):

Report Date:

1966-11-01

Pagination or Media Count:

8.0

Abstract:

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE