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
-
Least common multiple of many numbers
229 Solvers
-
75 Solvers
-
Basic electricity in a dry situation
553 Solvers
-
71 Solvers
-
505 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!