原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
∞ (the identity for min) by 0 (the identity for +), yields the procedure MATRIX-MULTIPLY.
We can see that the procedure EXTEND-SHORTEST-PATHS(L(r−1), W, L(r), n) computes the matrix “product” L(r) = L(r−1). W using this unusual definition of matrix multiplication.2 Thus, we can solve the
all-pairs shortest-paths problem by repeatedly multiplying matrices. Each step extends th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea