Abstract typeintro
Graph
Also called graph ADT, vertex-edge structure.
Abstract type of vertices and edges supporting adjacency and neighbourhood queries.
Abstract type of vertices and edges supporting adjacency and neighbourhood queries.
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 0MSSM6 Edit this page History Report an error