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
Pairing#5444
Very easy
Sociology#5445
Very hard
Circulation#5446
Very easy
Republics#5464
Hard
Odd Cut#5467
Very hard
Minimum Cut Matrix#5468
Very hard
Space Expedition#5470
Very easy
Town#5476
Very hard
Rooks#5481
Very hard
The Road to School#5486
Medium
Ancient Civilizations#5487
Very hard
Voting#5489
Very hard
One-way streets#5490
Very hard
Host Place#5497
Hard
Yoyu Nyerk#5505
Easy
The Grasshopper and the Ant#5528
Very easy
Tunnel Network Optimization#5549
Very hard
Invasion#5550
Easy
Mundial#5615
Medium
Labyrinth#5622
Very easy
Cross-stitch#5624
Very hard
Surely You Congest#5652
Very hard