Striver A2Z · Bounded-Hop Shortest Path (Bellman-Ford Style)
Relax edges for a limited number of rounds (bounding the number of hops/stops) rather than running unbounded Dijkstra, since the constraint makes plain Dijkstra unsound.
Sheet Problems: 1
Category: Graphs
ℹ
Curated selection from Striver A2Z
This sheet features 1 problem testing this technique. For the complete collection of problems and detailed algorithmic intuition, visit the Bounded-Hop Shortest Path (Bellman-Ford Style) Pattern Guide.
Featured Problems (1)
Explore More Patterns in Striver A2Z
Track your progress across all 243 problems in this curriculum roadmap.