Algorithmintro
Generic component-growing algorithm
Builds the connected component of a start vertex by repeatedly adding any vertex adjacent to the current set, the common core of BFS and DFS.
Builds the connected component of a start vertex by repeatedly adding any vertex adjacent to the current set, the common core of BFS and DFS.
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 753N4R Edit this page History Report an error