原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
i to j with at most r edges is by taking a path containing at most r − 1 edges, so that .
Another way is by taking a path of at most r − 1 edges from i to some vertex k and then taking the edge (k, j), so that . Therefore, to examine paths from i to j consisting of at most r edges, try all possible predecessors k of j, giving the recursive definition
The last equality follows from the observation that wjj = 0 for all j. What are the actua
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea