Problemintro
Cycle detection
Also called detecting cycles.
Decide whether a graph contains a cycle, for directed or undirected graphs.
Decide whether a graph contains a cycle, for directed or undirected graphs.
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 4QZM2W Edit this page History Report an error