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
-
Count from 0 to N^M in base N.
241 Solvers
-
666 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2587 Solvers
-
Put two time series onto the same time basis
359 Solvers
-
Vector of numbers divisible by 3
154 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
