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
-
506 Solvers
-
11204 Solvers
-
Arrange vector in ascending order
822 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
520 Solvers
-
Change the sign of even index entries of the reversed vector
659 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
