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
Draughts#6771
Very easy
Chain & Co.#6773
Medium
Digraphs#6776
Very easy
Count the Regions#6780
Very easy
Antenna Placement#6819
Very easy
Eco-driving#6831
Hard
Food Review#6832
Very easy
Horror List#6834
Very easy
Kindergarten#6837
Very easy
Unfoldung#6843
Very hard
Map Labeler#6845
Very easy
Colors#6850
Hard
Magic pyramid#6865
Very hard
Pirates#6900
Hard
Minesweeper#6904
Very hard
New Island#6910
Very easy
Subdictionary#6911
Very easy
Sharif Super Computer#6912
Very hard
Crazy Bits#6914
Very hard
Nurikabe#6915
Hard
Grasshopper#6917
Medium