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
Empire#1910
Very easy
Reform#1911
Very hard
ICPC#1914
Very hard
Tiny Puzzle#1923
Very hard
Perspective#1927
Very easy
Colored Wizards - 2#1933
Very easy
Regular matching#1935
Very hard
Flights#1936
Very easy
Fire safety#1937
Very easy
King#1939
Easy
Ice rink#1940
Hard
Inevitability#1942
Very easy
Bridges#1943
Very easy
Colorful Wizards#1944
Very easy
Mailman#1946
Medium
Condensation of the graph#1947
Very easy
Topological Sort#1948
Very easy
Sphere#1969
Very hard
Railroad#1979
Medium