原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
uses adjacency lists.) For convenience, we assume that the vertices are numbered 1, 2, …
, |V|, so that the input is an n × n matrix W = (wij) representing the edge weights of an n-vertex directed graph G = (V, E), where
The graph may contain negative-weight edges, but we assume for the time being that the in
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea