Algolib

The documentation of Algolib is accessible at https://www.adrienvannson.fr/algolib/ .

These algorithms and data structures are implemented in Algolib:

• Data structures
  • Disjoint set
  • Max Heap
• Graphs
  • Data structures
    • Graph
    • Weighted graph
  • Algorithms
    • Bellman-Ford
    • BFS
    • Dijkstra
    • Edmonds-Karp
    • Floyd-Warshall
    • Conversion to bipartite graph
    • Kosaraju
    • Kruskal
    • Min-Cut
    • Prim
    • Tarjan
    • Topological sort
    • Transpose graph
• Tree
  • Convert a graph to a rooted tree or a forest
• Geometry
  • Vector (2D and 3D)
  • 2D Convex Hull
  • Intersections
  • Projections
• Maths
  • Exponentiation by squaring
  • Fraction
  • GCD, LCM, Extended Euclidean algorithm
  • Matrix
  • Modulo
  • Permutation
  • Polynomial
  • Prime decomposition
  • Sieve of Eratosthenes
• Sorting
  • Merge sort
• Strings
  • Utility
    • Split
  • Automaton
  • Regex
  • Knuth–Morris–Pratt algorithm
• 2-SAT
• Simplex
• JSON parser