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
Strahler Order#6389
Very easy
Seven Kingdoms#6397
Very hard
Dreaded Alternating Game#6409
Very easy
Fare Dodging#6411
Very easy
Keys#6416
Easy
Destination Unknown#6420
Very easy
Getting Through#6423
Medium
Jailbreak#6426
Very easy
Beehives#6427
Very easy
Tree#6450
Very easy
Magic Roads#6451
Very easy
Danger#6455
Very easy
Redundant Edges#6456
Medium
Coloring#6457
Hard
Rank#6462
Medium
Tree Distance#6466
Medium
The Swapping Game#6526
Very easy
Connecting Islands#6529
Very hard
Field Plan#6535
Very hard
Sightseeing#6550
Easy
Road#6576
Very easy