原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
5 shows the matrices T(k) computed by the TRANSITIVE-CLOSURE procedure on a sample graph.
The TRANSITIVE-CLOSURE procedure, like the Floyd-Warshall algorithm, runs in Θ(n3) time. On some computers, though, logical operations on single-bit values execute faster than arithmetic operations on integer words of
data. Moreover, because the direct transitive-closure algorithm uses only boolean values
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea