Build your intuition. Is this statement true or false?
Breadth-first search always guarantees finding the shortest path between two nodes in a graph.
Press true if you believe the statement is correct, or false otherwise.
Back to course sections
Mark As Completed Discussion