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
Fines#4289
Medium
Dictionary#4291
Very easy
Median Tree#4293
Easy
Stack Maze#4295
Very hard
Hashigo Sama#4299
Very hard
Teams#4320
Hard
Busy Bees#4322
Very hard
Bridges: The Final Battle#4326
Very hard
Party#4327
Very hard
Postal Reform#4328
Very easy
Triangular grid#4332
Medium
k-Highlander#4334
Very hard
Feathers on the Shaman's Head#4335
Very hard
Work for Robots#4346
Very easy
Turning Turtles#4350
Very easy
Painting#4351
Easy
Global Maximum Cut#4352
Very easy
Walrus on the blocks of ice#4365
Very easy
Arson#4369
Very easy
Evacuation#4370
Medium