Problemadvanced
Graph exploration
Also called exploring unknown graphs, online graph exploration.
Visit all vertices of an unknown graph by walking its edges while minimizing the total number of moves.
Visit all vertices of an unknown graph by walking its edges while minimizing the total number of moves.
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 7G8D2X Edit this page History Report an error