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
-
How to find the position of an element in a vector without using the find function
2815 Solvers
-
Vectorizing, too easy or too hard?
147 Solvers
-
Make a random, non-repeating vector.
11270 Solvers
-
Penny flipping - calculate winning probability (easy)
196 Solvers
-
372 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
