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
-
Select every other element of a vector
37251 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1298 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
109 Solvers
-
321 Solvers
-
Calculate distance travelled when given radius and rotations
243 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
