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
Marriage questions#7474
Medium
Riddicks Cube#7476
Medium
Fragmentation#7497
Medium
Hiking in the Hills#7499
Very easy
Landline Telephone Network#7531
Very easy
Flipping Cards#7538
Very easy
Cactus Jubilee#7563
Very hard
Distance on Triangulation#7564
Very easy
Froggy Ford#7566
Hard
Hypercube#7568
Hard
Cactus Revolution#7603
Very hard
Graph#7618
Hard
Insider's Information#7620
Very hard
Metro#7666
Easy
Pebble Automaton#7668
Very hard
A Journey to Greece#7706
Very easy
Bounty Hunter II#7707
Very easy
Change of Scenery#7710
Very easy
Legacy Code#7713
Medium