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
Binary Matrix 2#4090
Very hard
Warp Speed II#4096
Medium
Heavy Cargo#4114
Very easy
Robot Navigation#4120
Medium
Farm and factory#4133
Very easy
Simon the Spider#4159
Medium
Rally#4174
Hard
Repair#4243
Very easy
Fines#4289
Medium
Busy Bees#4322
Very hard
Global Maximum Cut#4352
Very easy
Texas Summers#4411
Medium
Going to the movie#4463
Medium
Snow in Berlandia#4592
Medium