Conceptintro
Shortest-path tree
Also called single-source shortest-path tree, SPT.
A tree rooted at the source that contains one shortest path from the source to every reachable vertex.
A tree rooted at the source that contains one shortest path from the source to every reachable vertex.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 7NTSGR Edit this page History Report an error