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
Kinds of figures#3756
Very easy
Chain#3758
Hard
Queue#3760
Hard
Chain-Confined Path#3770
Very hard
Outsourcing#3776
Hard
Treasure Diving#3783
Very hard
Knight Match Play#3787
Very hard
3D Blobs#3824
Medium
Minimal Spanning Tree#3835
Very easy
VAN DINSKY#3850
Easy
Article#3877
Very hard
Blots on Paper#3879
Very easy
The Young Networker#3882
Very easy
Forum#3922
Easy
Iguana#3931
Hard
Flood#3944
Very hard
Gadget Hackwrench#3945
Very easy
Hunt for Treasure!#3946
Very hard
Sources and sinks#3986
Very easy