Graph Algorithms
Shortest paths and minimum spanning trees: which algorithm fits which graph, and where the complexity moves.
Shortest paths and minimum spanning trees: which algorithm fits which graph, and where the complexity moves.
Adjacency matrices, adjacency lists, topological sort and union-find: how a graph is stored decides which algorithm is cheap.