Skip to content

Kyabc/Algorithms-and-DataStructures

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

データ構造とアルゴリズム

kyaの競技プログラミングのライブラリです.

  • verified
  • not verified

データ構造

  • Segment Tree
    • Segment Tree
    • Lazy Segment Tree
    • Dual Segment Tree
    • Dynamic Segment Tree
  • Union Find
    • Union Find
    • Partially Persistent Union Find
    • Potentialized Union Find
  • Sparse Table
    • Sparse Table
    • Disjoint Sparse Table
  • Binary Trie
  • Modint
  • Queue Aggregation
  • Skew Heap
  • Matrix
  • Li-Chao Segment Tree
  • Treap
  • Meldable Heap (Skew Heap)
  • Meldable Heap
  • Slope Trick

Geometric

  • geometric

Convolution

  • Fast Fourier Transform
  • Number Theoretic Transform (NTT-friendly, any mod)

Graph

  • Flow
    • Dinic
    • Ford-Fulkerson
    • Minimum Cost Flow (Primal-Dual?)
  • Minimum Spanning Tree
    • Directed MST
    • Manhattan MST
    • MST (Kruskal)
  • Shortest Path
    • Bellman-Ford
    • BFS on complement graph
    • Dijkstra
    • Warshall-Floyd
    • Shortest Path Faster Algorithm
  • Graph Template
  • Heavy Light Decomposition
  • Low-Link
  • Lowest Common Ancestor
  • Maximum Independent Set
  • Strongly Connected Component
  • Topological Sort
  • Tree Diameter
  • Two Edge Connected Component
  • Cartesian Tree
  • Hungarian method

Number Theory

  • Combination
  • Permutation
  • Divisor
  • Eratosthenes's Sieve
  • Euler's Phi
  • Miller-Rabin

String

  • Rolling-Hash
  • Z-Algorithm
  • Moris-Pratt
  • Suffix Array
  • LCP Array

About

C++ library for competitive programming

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages