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
Islands#3062
Very easy
Camelot#3063
Medium
Coin Collecting#3065
Very hard
Graph Theory#3074
Very easy
Road Signs#3081
Hard
Triangular Tiling#3082
Very hard
Winmine.exe#3088
Very hard
Paths in a Tree#3103
Very easy
Attack of the Giant n-pus#3115
Very easy
Stealth Ninja#3120
Medium
In and Out#3121
Hard
Quick out of the Harbour#3124
Very easy
Bad Wiring#3126
Very easy
Public Order Committee#3127
Very easy
Papa#3140
Medium
Coin Collectors#3152
Medium
Graph#3162
Hard
Bicoloring#3165
Medium