← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

23 第23章 所有结点对的最短路径

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.732Z

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