Breadth-First Search
E2107368
UNEXPLORED
Breadth-First Search is a fundamental graph traversal algorithm that explores vertices level by level from a starting node, often used to find the shortest path in unweighted graphs.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Breadth-First Search canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.