GraphsEvidence Contributing
BFS Shortest Path (Unweighted)
Standard BFS where each edge has equal weight, so the first time a node is reached is guaranteed shortest.
Practice Problems: 3
Difficulty: 0 Easy·2 Medium·1 Hard
Core technique
Review the technique, then try the mapped problems below. The right approach depends on each problem's constraints.
- Core Strategy: Standard BFS where each edge has equal weight, so the first time a node is reached is guaranteed shortest.