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
Highways#1982
Medium
Maximum matching#1989
Medium
Domino 2#1990
Very easy
Maximum flow#1991
Very easy
Device Survey#2001
Very easy
Weighing 2#2005
Very hard
Gift#2007
Medium
Tree#2021
Very easy
Cycles in the graph#2022
Medium
Road Reform#2073
Very easy
Poet#2078
Easy
Taxi#2083
Very easy
The Great Wall#2084
Very easy
Cut#2085
Easy
Corners#2089
Very easy
Data Center Cooling#2093
Medium
Game Time#2104
Easy
Hermes#2123
Very hard
Replica Placement#2189
Very hard
UFO#2201
Medium