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
Continuous Drawing#1709
Very hard
Maximum flow 0#1711
Very easy
Decomposition of the Flow#1714
Very easy
Hackers#1715
Hard
Dedication#1720
Very hard
Capital#1724
Very easy
Metro#1725
Medium
Customs duties-2#1727
Medium
Customs duties-3#1728
Very hard
Secret Message#1737
Very easy
Filling with domino#1738
Very easy
Blockade#1741
Easy
Three Cities#1743
Medium
Dots and Lines#1744
Very easy
The mafia in the city#1745
Very easy
Rook in the Maze#1746
Very easy
Space Travel#1747
Very easy
Transport nodes#1748
Very easy
Orange mood#1749
Hard