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
-
20979 Solvers
-
Create a function handle that reverses the input arguments of another function handle
157 Solvers
-
Calculate the Hamming distance between two strings
341 Solvers
-
Implement a bubble sort technique and output the number of swaps required
381 Solvers
-
425 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
