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

22 Solutions

13 Solvers

Last Solution submitted on Apr 14, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers13

George Berken Pauli Huusari Riccardo G. Lorenzo

Suggested Problems

Problem Tags

Community Treasure Hunt

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

Start Hunting!