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
Harry the Hamster#9885
Medium
Reverse the graph#10048
Very easy
Longest path in a tree#10050
Very easy
Breadth First Search 0-1#10056
Very easy
Breadth First Search 0-1-2#10058
Very easy
Shortest even path#10082
Very easy
Clock Tree#10122
Very easy
Timeline#10123
Medium
Cow Contest#10151
Very easy
Transitive closure#10157
Medium
IOI#10161
Medium
Vertex#10172
Very easy
Highways#10205
Easy