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
Resistance#7197
Very hard
Taxicab#7200
Hard
Polyhedron#7204
Very hard
Labyrinth#7215
Very easy
Mixing Colours#7216
Very hard
Queries on Graph#7248
Very easy
Graph from the Inside#7256
Very hard
Rectangle and Paths#7295
Medium
Hourglass#7319
Easy
Permugame#7324
Easy
Nova Poshta#7378
Easy
Shymbulak#7471
Hard