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 in Crimea#4550
Medium
The simplest task#4581
Very easy
Task about Appointment#4585
Very easy
Evacuation Plan#4586
Very hard
Ostoz#4588
Easy
Flow in a Dynamic Network#4589
Very easy
Snow in Berlandia#4592
Medium
Disclosure#4596
Very easy
K-edges graph#4603
Very easy
Pseudo automaton#4608
Very easy
Quiz#4609
Very easy
Game Score#4639
Hard
Domino#4640
Medium
News#4643
Hard
Cave#4646
Hard