Shortest paths by DAG relaxation
In a finite integer-weighted DAG set d(s)=0 and other d(v)=∞, process vertices in topological order, and relax each outgoing u→v by d(v)←min(d(v),d(u)+w(u,v)).
Key knowledge
In a finite integer-weighted DAG set d(s)=0 and other d(v)=∞, process vertices in topological order, and relax each outgoing u→v by d(v)←min(d(v),d(u)+w(u,v)). The resulting distances are exact, including with negative weights; the procedure costs O(|V|+|E|) in the unit-cost arithmetic model.
Conditions and scope
- Use a DAG; a cyclic graph needs another method.
- Unreachable vertices remain ∞; weights and comparisons must use a compatible exact cost model.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Lecture11 DAG Relaxation and topological induction proof, printed3–4; fixed finite integer weights as in the source.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- info-dag-shortest-path-method
- Revision
- university-core.1
- Structured reference record
- University core expansion