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
Mind Swap Problem#3178
Very hard
Color the Map#3201
Medium
Inherit the Spheres#3202
Very hard
The Safest Path#3206
Medium
Channel Allocation#3221
Medium
Markov Trains#3226
Very hard
City Under Current#3269
Medium
Light Road#3286
Hard
Sunny Graph#3291
Hard
World Trip#3293
Very hard
LCA#3298
Medium
LCA - 2#3299
Easy
Common Ancestor - 3#3300
Very easy
Transitive Closure#3330
Very easy
Robot Navigation#3339
Very hard
Path#3355
Easy