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
Failing Components#8328
Medium
Bus routes#8368
Very hard
Boxes#8434
Easy
Maximal Flows Dimension#8484
Very hard
Elections#8494
Easy
Circuits#8498
Easy
Weed#8501
Easy
BFFs#8516
Easy
Computer network#8553
Very easy
Missing Bridges#8555
Medium
Clubs#8560
Easy
Colorgraph#8561
Hard
Cheap traveling#8565
Medium
Like#8579
Easy
Roads#8586
Easy
Robinson#8703
Easy
Robot Race#8714
Very hard
Amalthea's new walk#8718
Very hard