Problemadvanced
Dynamic minimum spanning tree
Also called dynamic MST, fully dynamic minimum spanning forest.
Maintain a minimum spanning forest under edge insertions and deletions.
Maintain a minimum spanning forest under edge insertions and deletions.
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 KSVJYK Edit this page History Report an error