Problem 54810. Length of shortest path in a directed graph.
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 commentsProblem Recent Solvers9
Suggested Problems
-
6650 Solvers
-
477 Solvers
-
Back to basics 4 - Search Path
366 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
628 Solvers
-
Celsius to Fahrenheit converter
605 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!