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
Good Graphs#3417
Medium
Clique#3418
Very easy
Networking Company#3423
Very hard
Long Distance Taxi#3432
Very easy
Round Trip#3438
Very easy
Gridland#3469
Easy
Byteland Tour#3470
Very hard
Genetic Algorithms#3471
Very easy
Unidirectional TSP#3472
Very easy
Tour#3475
Medium
Weird Coloring#3491
Medium
Tantrix#3493
Hard
Inspector is Coming#3494
Very hard