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
Cycle#5178
Easy
LCA Problem Revisited#5218
Very easy
Alliances#5221
Very hard
Control chain#5229
Very hard
Duty#5231
Medium
Cohesive team#5240
Medium
Boat#5245
Very hard
Viral Ethics#5271
Very easy
Caves and Tunnels#5285
Very hard
Cow barns#5298
Hard
Hex#5340
Very easy
The Alliances#5341
Very hard
Bodyguards#5343
Very hard
Roadworks#5348
Medium
Cactus#5351
Easy
Head of the Organization#5366
Very easy
Sliding Block Puzzle#5416
Very hard
Mushrooms#5438
Medium