Shortest paths
Problems on shortest paths, including unweighted and weighted graphs, single-source and all-pairs distances, negative edges and negative cycles, grids and mazes, and paths with extra state such as fuel or time.
The Graphs section of the library covers breadth-first search, 0-1 BFS, Dijkstra's algorithm, Bellman-Ford, SPFA and Floyd-Warshall. Related problem sets are under Dijkstra algorithm, Breadth-first search and Graphs.
Problems
Rabbit Jumping#3404
Medium
Top of the Hill#3408
Very hard
Ticket to Ride#3504
Very hard
In Search of Brides#3509
Very easy
Play in Basic#3566
Very hard
LatticeLand#3574
Hard
Tourist Walk#3614
Medium
Turn Left#3619
Hard
Help Vasya#3704
Very hard
Chess on a Torus#3720
Very hard
Ants Colony#3745
Very easy
Railway Connection#3769
Very easy
VAN DINSKY#3850
Easy
Delivery of kefir#4006
Very easy
Smoking gun#4014
Hard
Train delays#4017
Medium
Ideal Path#4089
Easy