My Algorithm : kopricky アルゴリズムライブラリ

Loading [Contrib]/a11y/accessibility-menu.js

$\newcommand{\O}{\mathrm{O}}$ My Algorithm : kopricky アルゴリズムライブラリ

コード

Academic

BIT 2D RangeAdd RangeSum

Bit Vector

Dijkstra with Fibonacci Heap

Dijkstra with Radix Heap

Dinic with Dynamic Tree

Dynamic Connectivity Algorithm

Exact Treewidth *O(2^n) Algorithm

Exact Treewidth PSPACE Algorithm

Fibonacci Heap

Finding All Cycles

Finding Potential

Fully Retroactive Deque

Fully Retroactive Union Find

Gale Sharpley

Irving

Lineartime RangeMinimumQuery

Lineartime Superbubble Algorithm

Making Heaps Meldable

Maximum Flow Algorithm on st-Planar Graph

Minimum Arborescence Algorithm

O(m log log n)-time MST

Parallel Quick Sort

Partial Persistent Linked Data Structure

Prim with Fibonacci Heap

Push Relabel

Random Graph Generator

Steiner Tree

Undirected Minimum Cut Algorithm

Unweighted Maximum Matching Algorithm

Binary Search Tree

Classic Problem

Counting the Number of Distinct Substrings

$C_4$ Find Algorithm

Limited Knapsack Algorithm

Finding the Longest Palindrome Sequence

Computation (Basic)

Computation (Advanced)

01 Knapsack Branch and Bound

2 SAT Algorithm

Baby Step Giant Step Algorithm

Chinese Remainder Theorem

Continued Fraction Algorithm

Fast Mobius Transform

Fast Zeta Transform

Garner Algorithm

Inversion Count Algorithm

Lagrange Interpolation

Miller Rabbin

Multipoint Evaluation

Polynomial Interpolation

Recurrence Formula Solver

Slide Min Algorithm

Tetration

Data Structure (Basic)

Binary Indexed Tree (Fenwick Tree)

BIT 1D RangeAddQuery and RangeSumQuery

Data Structure (Advanced)

BIT 2D

Compressed Trie (Patricia Trie)

Convex Hull Trick

Dynamic Convex Hull Trick

2D Decreasing Sequence

Data Structure (OnGraph)

Euler Tour Tree

HL Decomposition

Lowest Common Ancester

Link Cut Tree

Partial Persistent Union Find

Union Find

Weighted Union Find

FFTs (Polynomial)

Fast Fourier Transform

Fast Walsh Hadamard Transform

Number Theoretic Transform

Polynomial Division

Polynomial Exponential

Polynomial Inverse

Polynomial Logarithm

Graph

Centroid Find Algorithm

Chromaticr Number Algorithm

Counting $C_4$

Constructing Dual Graph

Eldös Gallai's Theorem

Enumerating $C_3$

Euler Tour Algorithm

Eulerian Trail Algorithm

Havel-Hakimi

Maximum Independent Set Algorithm

Minimum Vertex Cover Algorithm

Topological sort

Tree Diameter Algorithm

Tree Isomorphism

Graph Decomposition

Articulation Node Find Algorithm(Constructing Block Cut Tree)

Bridge Find Algorithm

Centroid Decomposition

Functional Graph

Namori

Strongly Connected Component Algorithm

Graph (SP, MST)

Matrix

Misc

Erase Outer Inner Interval

Network Flow

Bipartite Matching Algorithm

Dinic Algorithm

Hungarian

Minimum Cost Flow Algorithm

Minimum Cost Flow Algorithm on DAG

Original Container

Original Type

Accuracy Multi Precision

Multi Precision Integer

Rational Number

Segment Trees

Basic

RangeAddQuery and RangeMinQuery

RangeAddQuery and RangeSumQuery

RangeAndUpdateQuery RangeOrUpdateQuery and RangeMinQuery

RangeMaxupdateQuery and RangeSumQuery

RangeUpdateQuery RangeAddQuery and RangeSumQuery

RangeUpdateQuery RangeModuloQuery and RangeSumQuery

Orthogonal RangeReport

Rangetree PointUpdate

String

Syntax Analysis

Calculating a Numerical Expression with the Four Basic Arithmetic Operations

Constructing the Syntax Tree

Asobiba

Bipartite Matching on Range Edges

Path Query / Subtree Query + Ball Query

Path Add Path Sum with Centroid Decomposition

For Python