Problemadvanced
MST verification
Also called minimum spanning tree verification.
Decide whether a given spanning tree is a minimum spanning tree; linear time is possible.
Decide whether a given spanning tree is a minimum spanning tree; linear time is possible.
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 SVQ0EP Edit this page History Report an error