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
Cube Coloring#2372
Very easy
Electrification#2374
Medium
Galaxy Interconnection#2376
Very easy
Grafix Mask#2382
Very easy
Electrical Wires#2383
Very easy
Sorting Game#2384
Very easy
(p, q) - horse#2402
Very easy
Strong connectivity#2403
Medium
Games on graph#2404
Medium
Theta Puzzle#2448
Medium
Rankings#2453
Medium
Risk#2454
Very easy
Telephone Network#2457
Very hard
Operations on graph#2472
Very easy
Index#2475
Very hard
Strange Tournament#2477
Very hard
Linear Device#2481
Very hard