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
Save the Python Programmers!#3373
Very hard
City Driving#3377
Very easy
Dispatching#3384
Very easy
Bus Tour#3389
Easy
Infiltration#3391
Very hard
Keys#3392
Very hard
Minimum Cost Flow#3393
Very hard
A Safe Bet#3395
Very easy
Shortest Flight Path#3396
Very hard
Bicube#3399
Very hard
Rabbit Jumping#3404
Medium
Sightseeing Tour#3406
Very easy
Top of the Hill#3408
Very hard
Maximum Clique#3410
Medium
Maximal Clique#3411
Medium
Fat Hobbits#3412
Easy
Dinner#3415
Hard
Finding cliques#3416
Very easy