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 Solvers12
Suggested Problems
-
2342 Solvers
-
1359 Solvers
-
Back to basics 4 - Search Path
382 Solvers
-
Remove white space from the string
208 Solvers
-
Convert from Base 10 to base 5
281 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
