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
Men in Black#4953
Very hard
Bad Roads#4956
Easy
Game with Cards#4962
Very easy
Roadworks#4969
Easy
Cap#4977
Easy
Camelot#4979
Very hard
Co-workers from Hell#5042
Very easy
Isolator#5070
Very easy
Semi-complete graph#5077
Very easy
Graph tournament#5078
Very easy
Transitivity of directed graph#5079
Very easy
Degrees of vertices#5082
Very easy
Number of hanging vertices 2#5088
Very easy
Graph Connectivity#5135
Very easy
Swamp#5140
Easy
Lasers#5161
Hard
Pete's dad#5174
Easy