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
Build More Roads!#5677
Medium
Secret Lab#5678
Very hard
Your Ways#5701
Very hard
Highway Patrol#5706
Very hard
Museum#5733
Very hard
Morphing is fun#5734
Very hard
Hedge Mazes#5747
Very hard
Traffic Rules#5771
Very hard
Petya is resting#5772
Very hard
Traveling Cube#5791
Very easy
Zigzag#5795
Very hard
Slim Span#5831
Medium
Move on Dice#5840
Very easy
Repairing#5843
Easy
Mr. Chudakov's Buses#5920
Very easy
I`ll Be Round About#6009
Very hard
Matrix#6016
Very easy