原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
rected edge in the graph corresponds to one of the m inequalities involving two unknowns.
More formally, given a system Ax ≤ b of difference constraints, the corresponding constraint graph is a weighted, directed graph G = (V, E), where V = {v0, v1,
… , vn} and E = {(vi, vj) : xj − xi ≤ bk is a constraint} ∪ {(v0, v1), (v0, v2), (v0, v3)
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea