Use of Floyd's Algorithm to Find Shortest Restricted Paths.

摘要

In a directed network with no negative circuit, Floyd's algorithm finds, for each pair of nodes x and y, a shortest path from x to y. Here the procedure is extended to minimize more general length functions over sets of paths that are restricted in various ways.