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
-
91 Solvers
-
First non-zero element in each column
942 Solvers
-
Remove from a 2-D matrix all the rows that contain at least one element less than or equal to 4
139 Solvers
-
Circular Primes (based on Project Euler, problem 35)
651 Solvers
-
Generate binary combinations for a given number of bit(s)
95 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
