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
Wires#3501
Easy
Square#3502
Medium
Ticket to Ride#3504
Very hard
In Search of Brides#3509
Very easy
Reconstruction#3512
Medium
Save your cats#3543
Very easy
Dungeon Wall#3544
Medium
Bouldering#3546
Very hard
Asynchronous Exceptions#3560
Very hard
Dungeon Creation#3564
Very hard
Three-way Branch#3568
Very hard
Collateral Cleanup#3573
Very hard
Locksmith#3576
Very hard
A Famous King`s Trip#3586
Very hard
Two Famous Companies#3589
Very hard
A Famous Grid#3591
Very easy