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
Parades#7717
Very easy
Game#7762
Easy
Kernel Knights#7782
Very easy
Cafe#7796
Very easy
TROLLEYBUS ROUTES#7821
Medium
COMPUTER NETWORK#7825
Medium
Digi Comp II#7854
Very easy
Hyacinth#7858
Very easy
Indoorienteering#7859
Very easy
Cleaning Pipes#7864
Medium
Flowery Trails#7913
Medium
Book Club#7915
Easy
Gnomes#7945
Very easy
Airports#8181
Very easy
Grid#8195
Very easy
Buggy Robot#8202
Hard
Islands#8217
Easy
Researchers#8253
Medium
Roads#8257
Very easy
Walk#8258
Very hard
SUPPORT SCHOOLS#8300
Very hard