Definitionintro
Arborescence
A rooted directed spanning tree in which every vertex is reachable from the root by exactly one directed path.
A rooted directed spanning tree in which every vertex is reachable from the root by exactly one directed path.
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 B0093F Edit this page History Report an error