原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
mately 300,000 signal-controlled intersections1 and many more uncontrolled intersections.
A legitimate application of all-pairs shortest paths is to determine the diameter of a network: the longest of all shortest paths. If a directed graph models a communication network, with the weight of an edge indicating the time required for a message to traverse a communication link, then the diameter gives the longest possible transit time for a message in the network.
As in Chapter 22, the input is a weighted, directed graph G = (V, E) with a weight functi
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea