cpplib

Library Files

graph

• Dijkstra (単一始点最短経路) (graph/dijkstra.hpp)
• Ford Fulkerson (maximum flow) (graph/fordFulkerson.hpp)
• graph/graphTemplate.hpp
• LCA (Lowerst Common Ancestor) (graph/lca.hpp)
• Minimum Spanning Tree (Kruskal) (graph/maximumSpanningTree.hpp)
• graph/minimumSpanningTree.hpp
• SCC (Sstrongly Connected Components) (graph/scc.hpp)
• Warshall Floyd (全頂点対最短経路) (graph/warshallFloyd.hpp)

.

• macros.hpp

math

• combination mod 組み合わせ (math/comb.hpp)
• Matrix (行列) (math/matrix.hpp)
• mod int (math/mint.hpp)

segmentTree

• Range Minimum Query (segmentTree/rangeMin.hpp)

structure

• BIT (Binary Indexed Tree) (structure/bit.hpp)
• Union Find (structure/unionFind.hpp)
• Weighted Union Find (structure/weightedUnionFind.hpp)

Verification Files

.

• example.test.cpp

test

• test/comb.aoj_DPL_5_E.test.cpp
• test/modint_pow.aoj_DPL_5_A.test.cpp
• test/union_find.aoj.test.cpp

test/graph

• test/graph/dijkstra.aoj_GRL_1_A.test.cpp
• test/graph/fordFulkerson.aoj_GRL_6_A.test.cpp
• test/graph/kruskal.aoj_ALDS1_12_A.test.cpp
• test/graph/lca.aoj_GRL_5_C.test.cpp
• test/graph/scc.aoj_GRL_3_C.test.cpp
• test/graph/warshallFloyd.aoj_GRL_1_C.test.cpp

test/segmentTree

• test/segmentTree/rangeMin.aoj_DSL_2_A.test.cpp

test/structure

• test/structure/BIT.aoj_DSL_2_B.test.cpp
• test/structure/weighted_union_find.aoj_V13_1330.test.cpp