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
Office#1755
Very hard
Cute table#1759
Very easy
Cell Phone Network#1766
Medium
Mountain Trails#1773
Very easy
Tourist Agency#1777
Very easy
Chain Code#1803
Medium
Task#1804
Hard
Quick Search#1816
Very easy
Comparing Answers#1821
Very easy
Fake scoreboard#1822
Very easy
Enchanted Object Search#1824
Very easy
Locks and keys#1827
Very hard
Vertex Cover#1873
Medium
The longest path#1875
Medium
Construction of a warehouse#1892
Very easy
Trade#1907
Hard