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
Robots on a grid#6020
Very easy
Car Trouble#6026
Medium
Box Run#6033
Easy
The King of the North#6037
Very easy
Timing#6039
Very hard
Power Grid#6051
Very hard
Go Go Gorelians#6057
Medium
Huge Knight#6063
Very hard
Bi-coloring#6065
Easy
Fiber Network#6119
Medium
RoboFest#6147
Easy
Trodden Cable#6161
Very hard
Graph Automata Player#6165
Very hard
Spotlight Movement#6166
Very hard
Multi Path Story#6168
Very hard
InterCity#6171
Very easy
Chess#6173
Very hard
Influence#6178
Easy
Plunder & Flee#6188
Medium
Redirect#6193
Very easy
Meteorite#6195
Very hard