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
Fence#6579
Medium
Magic Graphs#6580
Very hard
Fix the Pond#6600
Very easy
Joining Couples#6604
Very hard
Drop Zone#6605
Medium
Worst Case Scenario#6610
Medium
Spectrum#6622
Very hard
Full Board#6626
Easy
Battleships#6647
Very hard
Stampede!#6651
Very hard
Arbitrage#6664
Medium
Three Colors#6676
Very hard
Eating Brains#6696
Very hard
Deep In The Ocean#6697
Very hard
The Glorious Karlutka River =)#6742
Very easy
Subway#6769
Easy
Escape#6770
Medium