Problemintro
Bridge finding
Also called Cut edge finding.
Find all edges whose removal increases the number of connected components.
Find all edges whose removal increases the number of connected components.
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 4K6X3Z Edit this page History Report an error