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.
Solve

Solution Stats

68.75% Correct | 31.25% Incorrect
Last Solution submitted on Oct 23, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers10

Suggested Problems

Problem Tags

digraphs

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!