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
Prune#2482
Medium
Jealous Queen#2487
Very hard
Tea Party#2505
Very easy
Traveling Queen Problem#2530
Very hard
Honeymoon Hike#2533
Very easy
Cracking Tree Codes#2543
Medium
Magic Square#2554
Medium
Serial Numbers#2558
Medium
Safety Grade#2561
Medium
Road Planner#2567
Very hard
Painting#2569
Hard
G. tourist#2576
Hard
King's Tour#2621
Very easy
Reliable Nets#2622
Very easy
Two Longest Paths#2627
Very hard
Attention!#2632
Very easy
Detonating cord#2635
Very easy
Paper Route#2641
Easy
Tetris Alphabet#2646
Medium
Network Saboteur#2647
Very easy
Terminator#2660
Medium
Two Vessels#2690
Easy
Genealogical Tree#2696
Medium