Collection of implementations for fundamental algorithms problems, including data structures, numerical and combinatorial algorithms,graph algorithms, and computational geometry. Implementations are available in C++, Java, Fortran, and other languages.
* By Language,
C,C++,C#,Java,FORTRAN,Python,Mathematica,Pascal,ADA,Lisp,Binary
* By Problem
Data Structures
Dictionaries,Priority Queues,Suffix Trees and Arrays,Graph Data Structures,Set Data Structures,Kd-Trees
Numerical Problems
Solving Linear Equations,Bandwidth Reduction,Matrix Multiplication,Determinants and Permanents,Constrained and Unconstrained Optimization,Linear Programming,Random Number Generation,Factoring and Primality Testing,Arbitrary Precision Arithmetic,Knapsack Problem,Discrete Fourier Transform
Combinatorial Problems
Sorting,Searching,Median and Selection,Generating Permutations,Generating Subsets,Generating Partitions,Generating Graphs,Calendrical Calculations,Job Scheduling,Satisfiability
Graph Problems -- polynomial-time problems
Connected Components,Topological Sorting,Minimum Spanning Tree,Shortest Path,Transitive Closure and Reduction,Matching,Eulerian Cycle / Chinese Postman,Edge and Vertex Connectivity,Network Flow,Drawing Graphs Nicely,Drawing Trees,Planarity Detection and Embedding
Graph Problems -- hard problems
Clique,Independent Set,Vertex Cover,Traveling Salesman Problem,Hamiltonian Cycle,Graph Partition,Vertex Coloring,Edge Coloring,Graph Isomorphism,Steiner Tree,Feedback Edge/Vertex Set
Computational Geometry
Robust Geometric Primitives,Convex Hull,Triangulation,Voronoi Diagrams,Nearest Neighbor Search,Range Search,Point Location,Intersection Detection,Bin Packing,Medial-Axis Transformation,Polygon Partitioning,Simplifying Polygons,Shape Similarity,Motion Planning,Maintaining Line Arrangements,Minkowski Sum
Set and String Problems
Set Cover,Set Packing,String Matching,Approximate String Matching,Text Compression,Cryptography,Finite State Machine Minimization,Longest Common Substring,Shortest Common Superstring |
