Given a directed graph and a start and end node in the graph, return the minimum number of hops required to reach the end node from the starting node.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers14
Suggested Problems
-
4199 Solvers
-
1916 Solvers
-
Back to basics 3 - Temp Directory
387 Solvers
-
243 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
738 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
