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
Distance Sum#9496
Very hard
Big changes#9507
Very easy
Equidistant#9522
Hard
Cactus Revenge#9582
Medium
Wormhole Sort#9601
Very easy
Time is Mooney#9602
Medium
Taxi#9608
Very easy
Forest Fires#9613
Medium
Alpine valley#9621
Medium
Transport system#9635
Medium
Candy Chain#9673
Very hard
Ingredients#9674
Very easy
Pixels#9706
Hard
The Bridge on the River Kawaii#9748
Very hard
Bob in Wonderland#9761
Very easy
Jurassic Jigsaw#9876
Medium