contents.txt

# Any line followed by a '#' character is ignored
# Section headings must be in square brackets
# Subsections within a section should follow the format:
#   [filename within code directory][tab character \t][subsection title]

[Flags + Template + vimrc]
flags.txt	Flags
template.cpp	Template
vimrc	vimrc

[Data Structures]
data-structures/bit_binary_search.cpp	Bit Binary Search
data-structures/bit_range.cpp	Bit Range
data-structures/bit.cpp	Bit
data-structures/bit2d.cpp	Bit 2D
data-structures/centroid_decomposition.cpp	Centroid Decomposition
data-structures/color_update.cpp	Color Update
data-structures/hld_exx.cpp	Heavy-Light Decomposition (new)
data-structures/hld.cpp	Heavy-Light Decomposition
data-structures/hld-lamarca.cpp	Heavy-Light Decomposition (Lamarca)
data-structures/ita_lichao.cpp	Lichao Tree (ITA)
data-structures/mergesort_tree.cpp	Merge Sort Tree
data-structures/min_queue.cpp	Minimum Queue
data-structures/ordered_set.cpp	Ordered Set
data-structures/seg_tree_dynamic_lazy.cpp	Dynamic Segment Tree (Lazy Update)
data-structures/seg_tree_dynamic.cpp	Dynamic Segment Tree
data-structures/seg_tree_iterative.cpp	Iterative Segment Tree
data-structures/seg_tree_mod.cpp	Mod Segment Tree
data-structures/seg_tree_persistent_naum.cpp	Persistent Segment Tree (Naum)
data-structures/seg_tree_persistent.cpp	Persistent Segment Tree
data-structures/seg_tree_point_update_struct.cpp	Struct Segment Tree
data-structures/seg_tree.cpp	Segment Tree
data-structures/seg_tree2d.cpp	Segment Tree 2D
data-structures/set_of_intervals.cpp	Set Of Intervals
data-structures/sparse.cpp	Sparse Table
data-structures/sparse2d.cpp	Sparse Table 2D
data-structures/splay.cpp	Splay Tree
data-structures/stanford_kdtree.cpp	KD Tree (Stanford)
data-structures/treap.cpp	Treap
data-structures/trie.cpp	Trie
data-structures/union_find.cpp	Union Find
data-structures/union_find_partial_persistent.cpp	Union Find (Partial Persistent)
data-structures/union_find_rollback.cpp	Union Find (Rollback)

[Dynamic Programming]
dynamic-programming/convex_hull_trick_emaxx.cpp	Convex Hull Trick (emaxx)
dynamic-programming/convex_hull_trick.cpp	Convex Hull Trick
dynamic-programming/divide_and_conquer_optimization.cpp	Divide and Conquer Optimization
dynamic-programming/knuth_optimization.cpp	Knuth Optimization
dynamic-programming/lis.cpp	Longest Increasing Subsequence
dynamic-programming/sos.cpp	SOS DP
dynamic-programming/steiner_tree.cpp	Steiner tree

[Graphs]
graphs/2_sat_kosaraju.cpp	2-SAT Kosaraju
graphs/2_sat_tarjan.cpp	2-SAT Tarjan
graphs/bellman_ford.cpp	Shortest Path (Bellman-Ford)
graphs/bfs.cpp	BFS
graphs/block_cut.cpp	Block Cut
graphs/bridges_and_articulations.cpp	Articulation points and bridges
graphs/dfs.cpp	DFS
graphs/dijkstra.cpp	Shortest Path (Dijkstra)
graphs/dinic.cpp	Max Flow
graphs/dominator_tree.cpp	Dominator Tree
graphs/erdos_gallai.cpp	Erdos Gallai
graphs/eulerian_path.cpp	Eulerian Path
graphs/fast_kuhn.cpp	Fast Kuhn
graphs/find_cycle_3_4.cpp	Find Cycle of size 3 and 4
graphs/floyd_warshall.cpp	Floyd Warshall
graphs/hungarian.cpp	Hungarian
graphs/hungarian_navarro.cpp	Hungarian Navarro
graphs/kahn.cpp	Toposort
graphs/kosaraju.cpp	Strongly Connected Components
graphs/kruskal.cpp	MST (Kruskal)
graphs/kuhn.cpp	Max Bipartite Cardinality Matching (Kuhn)
graphs/lca.cpp	Lowest Common Ancestor
graphs/max_weight_lca.cpp	Max Weight on Path
graphs/min_cost_max_flow.cpp	Min Cost Max Flow
graphs/prim.cpp	MST (Prim)
graphs/spfa.cpp	Shortest Path (SPFA)
graphs/small_to_large.cpp	Small to Large
graphs/stanford_stoer_wagner.cpp	Stoer Wagner (Stanford)
graphs/tarjan.cpp	Tarjan
graphs/zero_one_bfs.cpp	Zero One BFS

[Strings]
strings/aho_corasick.cpp	Aho-Corasick
strings/aho_emaxx.cpp	Aho-Corasick (emaxx)
strings/booths_algorithm.cpp	Booths Algorithm
strings/kmp_automaton.cpp	Knuth-Morris-Pratt (Automaton)
strings/kmp.cpp	Knuth-Morris-Pratt
strings/manacher.cpp	Manacher
strings/manacher_2.cpp	Manacher 2
strings/rabin_karp.cpp	Rabin-Karp
strings/recursive_string_matching.cpp	Recursive-String Matching
strings/string_hashing.cpp	String Hashing
strings/string_multihashing.cpp	String Multihashing
strings/suffix_array.cpp	Suffix Array
strings/suffix_automaton.cpp	Suffix Automaton
strings/suffix_tree.cpp	Suffix Tree
strings/z_function.cpp	Z Function

[Mathematics]
math/basics.cpp	Basics
math/advanced.cpp	Advanced
math/discrete_log.cpp	Discrete Log (Baby-step Giant-step)
math/euler_phi.cpp	Euler Phi
math/extended_euclid.cpp	Extended Euclidean and Chinese Remainder
math/fft_tourist.cpp	Fast Fourier Transform(Tourist)
math/fft.cpp	Fast Fourier Transform
math/fwht.cpp	Fast Walsh-Hadamard Transform
math/gauss_elim_ext.cpp	Gaussian Elimination (extended inverse)
math/gauss_elim_prime.cpp	Gaussian Elimination (modulo prime)
math/gauss_elim_xor.cpp	Gaussian Elimination (xor)
math/gauss_elim.cpp	Gaussian Elimination (double)
math/gss.cpp	Golden Section Search (Ternary Search)
math/josephus.cpp	Josephus
math/matrix.cpp	Matrix Exponentiation
math/mobius_inversion.cpp	Mobius Inversion
math/mobius.cpp	Mobius Function
math/ntt.cpp	Number Theoretic Transform
math/pollard_rho.cpp	Pollard-Rho
math/pollard_rho_optimization.cpp	Pollard-Rho Optimization
math/prime_factors.cpp	Prime Factors
math/primitive_root.cpp	Primitive Root
math/sieve.cpp	Sieve of Eratosthenes
math/simpson_rule.cpp	Simpson Rule
math/stanford_simplex.cpp	Simplex (Stanford)

[Geometry]
geometry/misc.cpp	Miscellaneous
geometry/basics.cpp	Basics (Point)
geometry/radial_sort.cpp	Radial Sort
geometry/circle.cpp	Circle
geometry/closest_pair.cpp	Closest Pair of Points
geometry/halfplane_intersection.cpp	Half Plane Intersection
geometry/lines.cpp	Lines
geometry/minkowski_sum.cpp	Minkowski Sum
geometry/nearest_neighbour.cpp	Nearest Neighbour
geometry/polygons.cpp	Polygons
geometry/stanford_delaunay.cpp	Stanford Delaunay
geometry/ternary_search.cpp	Ternary Search
geometry/delaunay.cpp	Delaunay Triangulation
geometry/voronoi.cpp	Voronoi Diagram
geometry/delaunay-emaxx.cpp	Delaunay Triangulation (emaxx)
geometry/closest_pair_3d.cpp	Closest Pair of Points 3D

[Miscellaneous]
misc/bitset.cpp	Bitset
misc/builtin.cpp	builtin
misc/date.cpp	Date
misc/ita_paren2polish.cpp	Parentesis to Poslish (ITA)
misc/merge_sort.cpp	Merge Sort (Inversion Count)
misc/modular_int.cpp	Modular Int (Struct)
misc/parallel_bin_search.cpp	Parallel Binary Search
misc/prime_numbers.txt	prime numbers
misc/python.py	Python
misc/sqrt_decomposition.cpp	Sqrt Decomposition
misc/stanford_latlong.cpp	Latitude Longitude (Stanford)
misc/week_day.cpp	Week day