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
Painting#2699
Medium
Babel#2717
Very easy
WoW#2741
Very hard
Contour Tracing#2754
Very easy
Robot Navigation#2756
Very easy
Railway#2775
Easy
Where am I?#2783
Hard
Bunkers#2784
Very hard
Metro#2795
Easy
Graph Orientation#2800
Medium
Knight Moves#2820
Medium
Happy Birthday#2852
Very easy
Monad#2859
Easy
Lame King High#2869
Very hard
Lame King Junior#2870
Very easy
Autotourism#2889
Very easy
Parking#2903
Very easy
Rook Attack#2904
Very easy
Flight of the Hamster 3#2944
Very hard