Definitionintro
Graph traversal
Also called graph search, graph exploration.
Systematically visiting every vertex reachable from a start vertex, each exactly once.
Systematically visiting every vertex reachable from a start vertex, each exactly once.
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 SQQF87 Edit this page History Report an error