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
Blue Forest#3602
Very hard
Tourist Walk#3614
Medium
Turn Left#3619
Hard
Maximum Flow A#3640
Very easy
Number of paths#3643
Very easy
Tiling#3645
Very easy
Sea Voyage#3647
Easy
Fifteen Puzzle#3669
Very hard
Mandatory vertices#3678
Very hard
Fingers#3690
Easy
Simple Monotony#3691
Very easy
Rooms#3697
Hard
Help Vasya#3704
Very hard
Chess on a Torus#3720
Very hard
Cut a graph#3728
Very easy
Ants Colony#3745
Very easy