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
Complete graph#3987
Very easy
Cheating away!#4002
Very easy
Is there a cycle?#4004
Very easy
Piece it together#4011
Very easy
Smoking gun#4014
Hard
Train delays#4017
Medium
Admiral#4022
Easy
Guards#4028
Easy
Peaks#4047
Hard
Toll Roads#4069
Very hard
Longest path#4087
Very easy
Ideal Path#4089
Easy
Distance in Tree#4104
Very easy
Heavy Cargo#4114
Very easy
Robot Navigation#4120
Medium
Kingdoms#4128
Very easy
Non-boring sequences#4131
Very easy
Word equations#4132
Very easy