fura2's Library

fura2 の競技プログラミングライブラリです．
g++ (C++17) で動作します． 一部のライブラリでは GNU 拡張を使用しています．

Library Files

library/data_structure

• Fenwick Tree (library/data_structure/Fenwick_tree.hpp)
• Dual Fenwick Tree (library/data_structure/Fenwick_tree_dual.hpp)
• library/data_structure/bit_vector.hpp
• library/data_structure/persistent_union-find.hpp
• Segment Tree (library/data_structure/segment_tree.hpp)
• Sparse Table (library/data_structure/sparse_table.hpp)
• Starry Sky Tree (library/data_structure/starry_sky_tree.hpp)
• Union-Find (library/data_structure/union-find.hpp)
• library/data_structure/union-find_with_data.hpp

library/flow

• library/flow/Dinic.hpp
• library/flow/Edmonds-Karp.hpp
• library/flow/bipartite_matching.hpp
• library/flow/primal_dual.hpp
• library/flow/primal_dual_neg.hpp

library/geometry

• library/geometry/Welzl.hpp
• library/geometry/area.hpp
• library/geometry/basic.hpp
• library/geometry/ccw.hpp
• library/geometry/convex_hull.hpp
• library/geometry/cover.hpp
• library/geometry/dist.hpp
• library/geometry/get_intersect.hpp
• library/geometry/intersect.hpp

library/graph

• Single-Source Shortest Path (Bellman-Ford Algorithm) (library/graph/Bellman-Ford.hpp)
• Single-Source Shortest Path (Dijkstra's Algorithm) (library/graph/Dijkstra.hpp)
• library/graph/Euler_tour_path.hpp
• library/graph/Euler_tour_subtree.hpp
• Travelling Salesman Problem (Held-Karp Algorithm) (library/graph/Held-Karp.hpp)
• Minimum Spanning Forest (Kruskal's Algorithm) (library/graph/Kruskal.hpp)
• Minimum Spanning Forest (Prim's Algorithm) (library/graph/Prim.hpp)
• Connected Components (library/graph/cc.hpp)
• Single-Source Shortest Path (Unweighted Graph) (library/graph/distance.hpp)
• Single-Source Shortest Path ($01$-BFS) (library/graph/distance_01.hpp)
• library/graph/functional_graph.hpp
• Graph (library/graph/graph.hpp)
• DAG Detection (library/graph/is_DAG.hpp)
• library/graph/odd_cycle.hpp
• Offline Reachability for Directed Graphs (library/graph/offline_reachability.hpp)
• Strongly Connected Components (Kosaraju's Algorithm) (library/graph/scc.hpp)
• Two-Edge Connected Components (library/graph/tecc.hpp)
• Topological Sort (library/graph/topological_sort.hpp)
• library/graph/two_coloring.hpp
• Weighted Graph (library/graph/wgraph.hpp)

library/linear_algebra

• library/linear_algebra/F2.hpp
• library/linear_algebra/Gauss-Jordan.hpp
• library/linear_algebra/Hadamard_matrix.hpp
• library/linear_algebra/matrix.hpp
• library/linear_algebra/matrix_tree_theorem.hpp
• library/linear_algebra/solve_eq.hpp
• library/linear_algebra/xor_basis.hpp

library/mint

• library/mint/Catalan.hpp
• library/mint/Montmort.hpp
• library/mint/Stirling_second.hpp
• library/mint/comb.hpp
• library/mint/det.hpp
• library/mint/mint.hpp
• library/mint/partition.hpp

library/misc

• library/misc/Grundy.hpp
• library/misc/binomial_parity.hpp
• library/misc/binomial_table.hpp
• library/misc/bint.hpp
• library/misc/digital_root.hpp
• library/misc/floor_sum.hpp
• library/misc/interval.hpp
• library/misc/inversion_number.hpp
• library/misc/knapsack.hpp
• library/misc/lis.hpp
• library/misc/permutation.hpp
• library/misc/popcount.hpp
• library/misc/pow.hpp
• library/misc/rational.hpp
• library/misc/rational_reconstruction.hpp
• library/misc/rle.hpp
• library/misc/sliding_minimum.hpp
• library/misc/zeta.hpp

library/monoid

• Additive Monoid (library/monoid/add_monoid.hpp)
• GCD Monoid (library/monoid/gcd_monoid.hpp)
• Maximum Monoid (library/monoid/max_monoid.hpp)
• Minimum Monoid (library/monoid/min_monoid.hpp)
• library/monoid/monoid.hpp

library/number_theory

• library/number_theory/Eratosthenes.hpp
• library/number_theory/Miller-Rabin.hpp
• library/number_theory/Pollard_rho.cpp
• library/number_theory/crt.hpp
• library/number_theory/divisor.hpp
• library/number_theory/enumerate_mod_inverse.hpp
• library/number_theory/gcd.hpp
• library/number_theory/is_prime.hpp
• library/number_theory/linear_sieve.hpp
• library/number_theory/mod_arithmetic.hpp
• library/number_theory/phi.hpp
• library/number_theory/prime_factor.hpp
• library/number_theory/prime_factorize.hpp
• library/number_theory/primitive_root.hpp

library/string

• library/string/rolling_hash.hpp
• library/string/sais.hpp
• library/string/trie.hpp
• Z Algorithm (library/string/z.hpp)

library

• library/template.hpp

library/tree

• Cartesian Tree (library/tree/Cartesian_tree.hpp)
• Lowest Common Ancestor (library/tree/lca.hpp)
• Rerooting (library/tree/rerooting.hpp)
• Diameter of a Tree (library/tree/tree_diameter.hpp)

Verification Files

verify/data_structure

• verify/data_structure/Fenwick_tree.1.test.cpp
• verify/data_structure/Fenwick_tree.2.test.cpp
• verify/data_structure/Fenwick_tree_dual.test.cpp
• verify/data_structure/segment_tree.1.test.cpp
• verify/data_structure/segment_tree.2.test.cpp
• verify/data_structure/segment_tree.3.test.cpp
• verify/data_structure/sparse_table.1.test.cpp
• verify/data_structure/sparse_table.2.test.cpp
• verify/data_structure/starry_sky_tree.test.cpp
• verify/data_structure/union-find.test.1.cpp
• verify/data_structure/union-find.test.2.cpp

verify/graph

• verify/graph/Bellman-Ford.test.cpp
• verify/graph/Dijkstra.1.test.cpp
• verify/graph/Dijkstra.2.test.cpp
• verify/graph/Held-Karp.test.cpp
• verify/graph/Kruskal.1.test.cpp
• verify/graph/Kruskal.2.test.cpp
• verify/graph/Prim.test.cpp
• verify/graph/cc.test.cpp
• verify/graph/distance.test.cpp
• verify/graph/distance_01.test.cpp
• verify/graph/is_DAG.1.test.cpp
• verify/graph/is_DAG.2.test.cpp
• verify/graph/offline_reachability.test.cpp
• verify/graph/scc.1.test.cpp
• verify/graph/scc.2.test.cpp
• verify/graph/scc.3.test.cpp
• verify/graph/tecc.1.test.cpp
• verify/graph/tecc.2.test.cpp

verify/string

• verify/string/z.1.test.cpp
• verify/string/z.2.test.cpp

verify/tree

• verify/tree/Cartesian_tree.test.cpp
• verify/tree/lca.1.test.cpp
• verify/tree/lca.2.test.cpp
• verify/tree/lca.3.test.cpp
• verify/tree/rerooting.1.test.cpp
• verify/tree/rerooting.2.test.cpp
• verify/tree/tree_diameter.1.test.cpp
• verify/tree/tree_diameter.2.test.cpp