原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
ncy list, it can find edge weights in O(1) time per edge. 22.1 The Bellman-Ford algorithm
The Bellman-Ford algorithm solves the single-source shortest-paths problem in the general case in which edge weights may be negative. Given a weighted, directed graph G = (V, E) with source vertex s and weight function w : E
→ ℝ, the Bellman-Ford algorithm returns a boolean value indicating whether there is a neg
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea