Algorithms And Data Structures 25-38
14 entries in the Algorithms And Data Structures compendium.
Gale–Shapley algorithmAlgorithm for stable matching, used in medical residency matching.Gradient descentFirst-order iterative algorithm for minimizing differentiable multivariate functions.Graph (abstract data type)Abstract data type implementing graph theory concepts.Hash tableA data structure mapping keys to values via hash functions.HeapsortEfficient comparison-based sorting using a binary heap.Held–Karp algorithmDynamic programming algorithm for exact TSP solution.Hungarian algorithmPolynomial-time algorithm for the assignment problem.Kruskal's algorithmGreedy algorithm for minimum spanning trees using sorted edges.Linked listA data structure where each node points to the next.Merge sortA stable, divide-and-conquer sorting algorithm invented by John von Neumann.Maximum flow problemProblem of maximizing flow through a network from source to sink.Minimum-cost flow problemOptimization problem to send flow at minimum cost.Max-flow min-cut theoremMaximum flow equals minimum cut capacity in a network.Maximum-cardinality matchingA matching with the largest possible number of edges in a graph.
Browse Algorithms And Data Structures 25-38 in the interactive codex →