Graphs
Problems on graph theory, including graph representation with adjacency matrices, incidence matrices and adjacency lists, vertex degrees, connectivity and connected components, cycles, bipartite graphs, shortest paths, minimum spanning trees, topological sorting, trees, flows, matchings and games on graphs.
Typical algorithms are breadth-first search, depth-first search, Dijkstra's algorithm, Floyd–Warshall, Bellman–Ford, Kruskal's and Prim's algorithms, and topological sort. The Graphs section of the library explains each of them.
Problems
Programming Technology#2202
Very hard
Roads#2203
Easy
Weak k-connectivity#2204
Very easy
Elevators#2209
Easy
Maze#2223
Easy
You won't catch up!#2244
Medium
Bug2#2259
Hard
Commuting Functions#2260
Very easy
Kitchen Robot#2268
Medium
Find a cycle#2270
Very easy
Connection Points 2#2271
Very easy
John's Car#2275
Very hard
Governor#2277
Very hard
Job or joy#2280
Very hard
Mining Your Own Business#2288
Very hard
Nuts for nuts#2302
Very easy
Number of elements#2313
Very easy
LCA Problem Revisited (Easy)#2318
Very easy
Magic#2350
Medium
Dijkstra#2351
Very easy
Jump!#2366
Easy