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
Camel#8723
Very hard
Ancient Azerbaijan#9003
Very easy
Cross the river#9006
Medium
Replacement#9008
Medium
Theorist#9012
Hard
Roads renewal#9032
Very easy
Pipes#9040
Medium
Strange Strelyandsk Journey#9048
Very easy
Combination lock#9057
Medium
Miner#9060
Medium
Investments Lady#9091
Very hard
Triples#9109
Easy
Excalibur#9411
Easy
Graphity#9413
Easy
Kill all termites#9414
Very easy
woogle.we#9417
Very easy