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
Party Night#6918
Very easy
Pachinko#6919
Very hard
Trust groups#6921
Very easy
Expensive subway#6922
Very easy
Route Change#6928
Medium
Come and Go#6933
Very easy
Traveling Fool#6949
Very hard
Bonnie's Battery#6962
Very easy
Enterprising Escape#6965
Very easy
Painted Cube#6976
Very easy
Tile Cut#6984
Very easy
Traitor#6988
Very hard
LED Circuit#6993
Very hard
Absurdistan Roads#7013
Very easy
Name the Crossing#7028
Very easy
Painting#7030
Hard
Portals#7034
Medium
Wall#7066
Hard
Magical Labyrinth#7092
Very hard
School#7096
Very easy
Intersection#7176
Very easy
Test#7195
Easy