原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
for finding the transitive closure of a directed graph. The structure of a shortest path
In the Floyd-Warshall algorithm, we characterize the structure of a shortest path differently from how we characterized it in Section 23.1. The Floyd-Warshall algorithm considers the intermediate vertices of a shortest path,
where an intermediate vertex of a simple path p = 〈v1, v2, … , vl〉 is any vertex of p oth
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea