Coding
Graph Traversal
Easy
Shortest Paths in an Unweighted Graph
What algorithm finds shortest paths from a source in an unweighted graph?
Quant interview-style problem · QS-XNA015
Question 1 of 2
Practicing conceptGraph Search: BFS, DFS, Dijkstra· 2 questions
← Back to lessonThink first. Use hints deliberately. Study the reasoning only when you need it.