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
-
370 Solvers
-
Calculate the Hamming distance between two strings
349 Solvers
-
359 Solvers
-
Convert Two Character String into a Binary Vector
241 Solvers
-
find the roots of a quadratic equation
243 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!