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
Triangles#6196
Medium
Erratic Ants#6203
Very easy
Trapezoid Walkway#6205
Medium
Island Buses#6209
Very hard
Dueling Philosophers#6213
Very easy
Tsunami#6217
Very hard
Random Walking#6220
Medium
Full Tank#6221
Hard
The Bottom of a Graph#6223
Very easy
Beacons#6225
Very hard
Food Review#6226
Very hard
Metro Manila Detour#6245
Very easy
Cliff Walk#6259
Easy
Dwarf Tower#6263
Medium
Autumn Park#6287
Medium
Hard Life#6298
Very hard
Interconnect#6299
Medium
Broken Switch#6360
Medium
Check to the king#6361
Medium
Rain Forest Canopy#6376
Very easy