← Questions
Shortest path in an unweighted graph: BFS versus DFS
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Explain how to find the shortest path between two nodes of an unweighted graph and its time complexity, without necessarily writing code. Then compare: why breadth-first search finds the shortest path directly, what depth-first search would need to do the same, and when each one is the better choice.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding