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
Intervals#2945
Very hard
Hierarchy#2946
Very hard
Magnetic Cushions#2964
Very easy
Pink Floyd#2966
Easy
Unification Day#2967
Very easy
Shortest Paths#2968
Very easy
Competition#2983
Medium
Paths#2988
Very hard
Alchemy#2991
Hard
Casino#2993
Very hard
Official Approval#2996
Very easy
No left turns#3011
Very hard
Maze#3014
Easy
Slink#3021
Easy
Hyperspace Disruption#3033
Very hard
Triomino#3035
Easy
Database#3037
Easy
Highway#3038
Hard
Spectrum Explorer#3050
Very easy
Detour Buster#3051
Very hard