알고리즘 & 자료구조 정리

Table of Contents

• Data Structures
  • Segment Tree Beats
• Graphs
  • Biconnected Component
  • Flows
    • Ford–Fulkerson method
    • Edmond-Karp algorithm
    • Min Cost Max Flow
  • Theorems
    • Kőnig's theorem
• Strings
  • Prefix Function
  • KMP
  • Aho-Corasick
  • Z Function
  • Suffix Array & LCP Array
  • Suffix Automaton
  • Eertree
  • Lyndon Decomposition
• Math
  • Polynomials and Series
    • FFT
    • FWHT

Team Note

• Personal Team Note

Todo

• Max Flow Min Cost theorem
• Sprague - Grundy theorem
• Dinic's algorithm
• eertree (paper review)
• SOS DP
• CHT (with floor divisions)
• Li Chao Tree (extended)
• Linear Programming

• Alien (with backtracking)

• k - vertex /edge connected component

• Menger's theorem
• well-defineness (maximality) of biconnected component
• erdos gallai theorem
• tutte's theorem
• hall's theorem
• dilworth's theorem