Problemintro
Distributed spanning tree construction
Also called distributed spanning tree, distributed BFS tree construction.
Make every node aware of a spanning tree of the network using only local communication.
Make every node aware of a spanning tree of the network using only local communication.
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 J43X2M Edit this page History Report an error