Examples Directory Reference

Files
	adversarial_artificial_example.cc
	Reference example: artificial game tree with Negamax and Alpha-Beta.
	ah_cpp_compat_example.cc
	Demonstrates Aleph::expected from the C++20/23 compatibility layer.
	ah_parallel_example.cc
	Parallel functional programming utilities (ah-parallel.H): map/filter/fold/predicates/scan/merge/zip/sort.
	ah_stl_functional_example.cc
	Comprehensive examples of ah-stl-functional.H usage.
	aho_corasick_example.cc
	Illustrative example for Aho-Corasick multi-pattern matching.
	alpha_beta_connect3_example.cc
	Reference example: Connect-3 with Alpha-Beta and move ordering.
	array_utils_example.cc
	Educational examples for array utility functions.
	astar_example.cc
	A* shortest path in Aleph-w (grid graph, heuristics, and comparison with Dijkstra).
	b_tree_example.cc
	Illustrative example for Aleph::B_Tree.
	backtracking_cyclic_graph_example.cc
	Reference example: DFS/backtracking on a cyclic directed graph using a depth-aware visited map (SearchStorageMap) to avoid loops.
	backtracking_nqueens_example.cc
	Reference example: N-Queens with DFS/backtracking.
	backtracking_subset_sum_example.cc
	Reference example: subset-sum enumeration with domain-side pruning.
	bellman_ford_example.cc
	Bellman-Ford shortest paths in Aleph-w (negative weights, negative-cycle detection, SPFA).
	bfs_dfs_example.C
	Graph traversal in Aleph-w: BFS vs DFS demos (comparison, paths, degrees, early stop, components).
	bidirectional_bfs_example.cc
	Illustrative example for Bidirectional Breadth-First Search (BFS).
	bipartite_example.C
	Bipartite graphs in Aleph-w (bipartition, tests, matching intuition, and examples).
	bitarray_example.C
	BitArray in Aleph-w (bit operations, set algebra, sieve demo, and memory/performance notes).
	bloom_filter_example.C
	Bloom filter in Aleph-w (probabilistic set membership, false positives, and tuning).
	blossom_example.cc
	General graph maximum matching with Edmonds-Blossom.
	bplus_tree_example.cc
	Illustrative example for Aleph::BPlus_Tree.
	branch_and_bound_artificial_example.cc
	Reference example: artificial maximization and minimization trees.
	branch_and_bound_assignment_example.cc
	Reference example: assignment minimization with branch and bound.
	branch_and_bound_df_vs_bf_example.cc
	Reference example: comparing Depth-First and Best-First strategies in Branch-and-Bound on a 0/1 knapsack problem.
	branch_and_bound_knapsack_example.cc
	Reference example: 0/1 Knapsack with branch and bound.
	btreepic.C
	Binary tree visualization tool: convert a .Tree description into LaTeX/eepic.
	bytecode_example.cc
	Minimal example that lowers explicit IR into reusable bytecode.
	bytecode_interpreter_example.cc
	Minimal example that lowers IR to bytecode and executes it in the VM.
	ca_bench_example.cc
	Phase-5 microbenchmark: parallel vs sequential GoL throughput.
	ca_boundary_policies_example.cc
	Side-by-side demonstration of every Phase 1 boundary policy.
	ca_checkpoint_phase17_example.cc
	Phase 17 showcase: compression, async writer and delta snapshots for ca-checkpoint.H.
	ca_critters_reversible_example.cc
	Phase 13 example: Toffoli & Margolus' Critters reversible CA.
	ca_export_example.cc
	Practical Phase-11 export pipeline for Conway's Game of Life.
	ca_forest_fire_example.cc
	Phase 8 example: Drossel–Schwabl forest-fire automaton.
	ca_gallery_gen.cc
	Phase 28 — render one PNG per canonical built-in CA rule.
	ca_game_of_life_example.cc
	Conway's Game of Life over a toroidal 2D lattice.
	ca_ghost_bench_example.cc
	Microbench: GoL 1024x1024 on Lattice (Phase 3) vs Ghost_Lattice (Phase 4).
	ca_ghost_boundary_showcase_example.cc
	Visual tour of every Phase 4 boundary policy for Ghost_Lattice.
	ca_ghost_gol_toroidal_example.cc
	Game of Life on a Ghost_Lattice with toroidal borders.
	ca_gray_scott_example.cc
	Phase 9 example: Gray-Scott reaction-diffusion with PPM export.
	ca_hashlife_example.cc
	A guided tour of Aleph::CA::Hashlife_Engine (Phase 10).
	ca_hex_life_example.cc
	Phase-6 illustration: Bays' B2/S34 hexagonal Game of Life.
	ca_html_demo_example.cc
	Self-contained HTML demo for Gray-Scott reaction diffusion.
	ca_io_expected_example.cc
	Parsing CA patterns without exceptions via the try_read_* overloads.
	ca_ising_magnetisation_example.cc
	Phase 8 example: Ising spins with Glauber dynamics + temperature sweep.
	ca_live_x11_viewer_example.cc
	Live X11 viewer example for Conway's Game of Life.
	ca_long_run_with_checkpoints_example.cc
	Phase 15 example: long-running CA with periodic checkpoints and crash-style resume.
	ca_neighborhoods_example.cc
	Pretty-print every neighborhood in the Phase 2 catalogue.
	ca_observability_example.cc
	Phase-7 illustration: every observer running together.
	ca_parallel_gol_example.cc
	Phase-5 illustration: a glider gun on a parallel GoL engine.
	ca_parallel_wolfram_example.cc
	Phase-5 illustration: parallel 1D Wolfram rule 30 / 110.
	ca_paraview_3d_example.cc
	Simple 3D cellular automaton exported as VTK legacy files.
	ca_predator_prey_multifield_example.cc
	Phase 14 example: a 2-field Lotka–Volterra CA in SoA layout.
	ca_sandpile_example.cc
	Phase 13 example: Bak–Tang–Wiesenfeld self-organised criticality.
	ca_schelling_async_vs_sync_example.cc
	Phase 13 example: how the update scheme reshapes Schelling segregation dynamics.
	ca_schelling_segregation_example.cc
	Phase 8 example: local Schelling segregation on a 2-D lattice.
	ca_sir_epidemic_example.cc
	Phase 8 example: SIR epidemic on a 2-D toroidal lattice.
	ca_triangular_example.cc
	Phase-6 illustration: a triangular lattice CA with up/down parity-aware neighbours.
	ca_visualization_gallery_example.cc
	Phase 11.5 gallery for CA visualisation backends.
	ca_voter_model_example.cc
	Phase-6 illustration: voter model on a small hand-built graph.
	ca_wolfram1d_example.cc
	Print one row of every elementary 1D Wolfram rule (0..255) starting from a single-1 impulse at the centre of a length-N lattice and advancing for T steps under an open boundary.
	cartesian_tree_example.cc
	Four creative scenarios demonstrating Cartesian Tree, LCA, and RMQ.
	centroid_decomposition_example.cc
	Story-driven demo of Centroid Decomposition dynamic nearest-center queries.
	chaikin_smoothing_example.cc
	Demonstrates Chaikin corner-cutting polygon smoothing with TikZ output.
	closest_pair_example.cc
	Closest pair of points via divide and conquer.
	comb_example.C
	Combinatorics helpers in Aleph-w (ah-comb.H): transpose, Cartesian products, combinations.
	combinatorics_enumeration_example.cc
	Extended lexicographic permutation and k-combination enumeration.
	compact_cuckoo_filter_example.C
	Comprehensive usage examples for Compact_Cuckoo_Filter.
	compact_quotient_filter_example.C
	Comprehensive usage examples for Compact_Quotient_Filter.
	compiler_backend_c_example.cc
	Minimal example that emits portable C from explicit IR.
	compiler_builder_example.cc
	Minimal example that builds HIR and IR manually without using the MVP parser.
	compiler_cfg_example.cc
	Minimal example that lowers typed HIR into reusable CFGs.
	compiler_dataflow_example.cc
	Minimal example that runs reusable dataflow analyses and DCE over Compiler_IR.H.
	compiler_diagnostics_example.cc
	Minimal example showing source management and diagnostic rendering.
	compiler_driver_example.cc
	Minimal example that exercises import-aware multi-file driver execution.
	compiler_hir_example.cc
	Minimal example that lowers typed AST into typed high-level IR.
	compiler_ir_example.cc
	Minimal example that lowers typed HIR into explicit-value IR.
	compiler_lexer_example.cc
	Minimal example that tokenizes a small source file.
	compiler_line_frontend_example.cc
	Minimal example that runs a second frontend through the generic driver.
	compiler_module_binder_example.cc
	Minimal example showing reusable top-level binding across modules.
	compiler_module_linker_example.cc
	Minimal example showing direct-import surface linking.
	compiler_module_name_diagnostics_example.cc
	Minimal example showing reusable diagnostics for module-name lookup.
	compiler_module_name_resolver_example.cc
	Minimal example showing reusable top-level module-name lookup.
	compiler_module_name_table_example.cc
	Minimal example showing cached per-module name tables.
	compiler_module_resolver_example.cc
	Minimal example showing reusable module dependency resolution.
	compiler_module_semantic_environment_example.cc
	Minimal example showing namespace-separated module environments.
	compiler_parser_example.cc
	Minimal example that parses and dumps a small module with imports.
	compiler_parser_utils_example.cc
	Minimal example showing reusable parser-stream helpers over the lexer.
	compiler_sema_example.cc
	Minimal example that parses and semantically analyzes a small module.
	compiler_symbol_bindings_example.cc
	Minimal example showing reusable lexical symbol bindings.
	compiler_typed_sema_example.cc
	Example showing nominal type declarations, transparent aliases, and basic polymorphism.
	compiler_types_example.cc
	Minimal example that builds nominal compiler types and solves simple equality constraints.
	concurrency_utils_example.cc
	Focused examples for bounded channels and synchronized wrappers.
	concurrent_hash_map_example.cc
	Several worker threads sharing one Aleph::ConcurrentHashMap.
	constrained_delaunay_example.cc
	Constrained Delaunay Triangulation (CDT) example.
	convex_hull_comparison_example.cc
	Compare 5 convex hull algorithms on one dataset.
	convex_polygon_distance_gjk_example.cc
	Convex polygon distance with GJK.
	cuckoo_filter_example.cc
	cut_nodes_example.C
	Cut nodes (articulation points), bridges, and biconnected components.
	damerau_levenshtein_example.cc
	Illustrative example for Damerau-Levenshtein distance.
	delaunay_voronoi_example.cc
	Delaunay triangulation + Voronoi dual + clipped cells.
	deway.C
	Dewey ("deway") numbering for tree nodes (path-based hierarchical addresses).
	dial_example.cc
	dijkstra_example.cc
	Dijkstra shortest paths in Aleph-w (single path, shortest-path tree, and heap trade-offs).
	disjoint_sparse_table_example.cc
	Disjoint Sparse Table applied to real-world scenarios.
	disjoint_sparse_table_test.cc
	Comprehensive test suite for Disjoint Sparse Table implementation.
	dispatcher_example.C
	Dispatcher pattern in Aleph-w (ah-dispatcher.H) with tree and hash backends.
	dominators_example.cc
	Demonstrates dominator tree and dominance frontier computation for SSA construction in a compiler pipeline.
	dp_optimizations_example.cc
	Illustrated use cases for DP_Optimizations.H.
	driven_table_example.C
	Example demonstrating both legacy and modern use of Event Tables.
	dynmap_example.C
	DynMapTree (ordered map) with multiple tree backends + demo suite and benchmark.
	dynset_trees.C
	DynSetTree (dynamic set) with multiple BST backends in Aleph-w.
	edit_distance_example.cc
	Illustrative example for Levenshtein edit distance.
	eulerian_example.C
	Eulerian paths/cycles in Aleph-w (eulerian.H) with classic demos and rich visual explanations.
	experimental_async_example.cc
	Minimal example for Aleph-w's experimental async bridge.
	fenwick_tree_example.cc
	Fenwick trees applied to trading and sports betting.
	fft_benchmark.cc
	Baseline benchmark and validation utility for fft.H.
	fft_example.cc
	Detailed demonstration of the Fast Fourier Transform (FFT).
	fft_reference_probe.cc
	Emits deterministic FFT reference cases as JSON.
	fib.C
	Fibonacci sequence: Three implementation strategies compared.
	fibonacci.C
	Fibonacci number computation: Three implementation strategies compared.
	file_b_map_example.cc
	file_b_tree_example.cc
	Illustrative example for Aleph::File_B_Tree.
	file_bplus_map_example.cc
	file_bplus_tree_example.cc
	Illustrative example for Aleph::File_BPlus_Tree.
	functional_example.C
	Comprehensive example of functional programming in Aleph-w.
	gen_rand_graph.C
	Generate random Euclidean graphs for testing and visualization.
	generate_forest.C
	Example demonstrating forest generation from binary trees.
	generator_example.cc
	Aleph::Generator<T>: lazy sequences with C++20 coroutines.
	geom_example.C
	Comprehensive example demonstrating Aleph-w's computational geometry.
	graph_coloring_example.cc
	Graph coloring algorithms in Aleph-w: greedy, Welsh-Powell, DSatur, and exact chromatic number.
	graph_coloring_graphviz_example.cc
	Export colored graphs to Graphviz DOT for visual comparison.
	graph_components_example.C
	Graph connectivity: components and spanning trees.
	graph_to_tree_example.cc
	Educational examples for converting graphs to tree structures.
	graphpic.C
	Generate LaTeX/eepic pictures of graphs and digraphs.
	gray_code_example.cc
	Demonstrates usage of Gray code utilities in Aleph-w.
	grid_example.cc
	halfplane_intersection_example.cc
	2D linear-programming feasible region via half-plane intersection.
	hamiltonian_example.C
	Example demonstrating Hamiltonian graph testing in Aleph-w.
	hash_resize.C
	Example demonstrating hash table with automatic resizing.
	hash_tables_example.C
	Hash table implementations in Aleph-w: A comprehensive guide.
	heap_example.C
	Priority Queues: Binary Heap vs Fibonacci Heap.
	heavy_light_decomposition_example.cc
	Story-driven demo of Heavy-Light Decomposition path/subtree queries.
	hld_example.cc
	Human-friendly demo of Heavy-Light Decomposition on Aleph tree graphs.
	horspool_example.cc
	Illustrative example for Boyer-Moore-Horspool matching.
	hungarian_example.cc
	ida_star_example.cc
	Illustrative example for Iterative Deepening A* (IDA*) algorithm.
	ida_star_grid_example.cc
	Reference example: IDA* pathfinding on a 2-D grid.
	ida_star_no_solution_example.cc
	Reference example: IDA* on a DAG where no path to the goal exists.
	interpreter_runtime_example.cc
	Minimal example that evaluates typed HIR with the reusable runtime.
	interval_tree_example.cc
	Example: meeting scheduler and 1D segment intersection.
	johnson_example.cc
	Johnson all-pairs shortest paths in Aleph-w (negative weights, Floyd comparison, benchmark flags).
	joseph.C
	Josephus Problem: Classic elimination puzzle solved with linked lists.
	k_shortest_paths_example.cc
	K shortest paths: loopless Yen vs general Eppstein-style API.
	karger_example.cc
	Comprehensive educational example for Karger's min-cut algorithm.
	kmp_example.cc
	Illustrative example for KMP pattern matching.
	knapsack_example.cc
	Rich, side-by-side demo for Knapsack variants.
	kosaraju_example.cc
	Comprehensive example of Kosaraju's algorithm for SCCs.
	lazy_graph_traversal_example.cc
	Lazy graph BFS/DFS with coroutines (graph-traverse-generators.H).
	lazy_tree_traversal_example.cc
	Lazy binary tree traversal with coroutines (tpl_binNodeGenerators.H).
	lca_example.cc
	Human-friendly demo of LCA on Aleph tree graphs.
	lcs_longest_common_substring_example.cc
	Illustrative example for LCS and Longest Common Substring.
	linear_structures_example.C
	Linear data structures: Stack, Queue, DynArray, DynList.
	link_cut_tree_example.cc
	Illustrative examples for Link-Cut Trees.
	lis_example.cc
	Visual walkthrough for LIS and LNDS variants.
	load_digraph_example.cc
	Educational examples for saving/loading directed graphs from files.
	manacher_example.cc
	Illustrative example for Manacher's palindrome algorithm.
	map_arena_example.C
	Example demonstrating MapArena memory-mapped file allocator.
	map_arena_persistence_example.cc
	Premium MapArena example: persistence, offsets, and restart.
	mapping_example.C
	Comprehensive example demonstrating Aleph-w's AHMapping class.
	mat_path_example.cc
	Educational examples for path reconstruction from distance matrices.
	math_nt_example.cc
	Demonstration of Number Theory and Modular Arithmetic algorithms.
	matrix_chain_example.cc
	Illustrated examples for matrix-chain optimization.
	matrix_example.C
	Comprehensive example demonstrating sparse matrices and vectors in Aleph-w.
	maxflow_advanced_example.cc
	Advanced Maximum Flow Algorithms Comparison.
	mdspan_ca_lattice_view_example.cc
	Dense_Cell_Storage::view(): an Aleph::mdspan over a CA lattice.
	mdspan_matrix_view_example.cc
	Aleph::mdspan as a zero-copy 2D "matrix" view over a flat buffer.
	min_cost_matching_example.cc
	Dedicated minimum-cost matching in general graphs.
	min_cut_example.cc
	Educational examples for minimum cut algorithms.
	min_cut_test.cc
	Comprehensive test suite for min-cut algorithms.
	min_mean_cycle_example.cc
	Example: Karp minimum mean cycle on Aleph digraphs.
	mincost_flow_example.cc
	Minimum Cost Maximum Flow: Optimization with Cost Constraints.
	minimum_enclosing_circle_example.cc
	Minimum enclosing circle via Welzl's algorithm.
	mo_algorithm_example.cc
	Four creative scenarios demonstrating Mo's algorithm.
	mo_on_trees_example.cc
	Three creative scenarios demonstrating Mo's algorithm on trees.
	mpsc_queue_example.cc
	Several producer threads feeding one consumer through Aleph::MpscQueue.
	mst_example.C
	Minimum Spanning Tree algorithms: Kruskal and Prim.
	multi_polynomial_examples.cc
	Practical examples demonstrating multivariate polynomial usage.
	negamax_simple_example.cc
	Minimal Negamax example: solve Tic-Tac-Toe from the empty board.
	negamax_tictactoe_example.cc
	Advanced example: Tic-Tac-Toe with Negamax, Alpha-Beta, transposition tables, iterative deepening and aspiration windows.
	net_apps_example.cc
	Network Flow Applications: Real-World Problem Solving.
	net_utils_example.cc
	Network Utilities: Generation, Visualization, Serialization.
	network_flow_example.C
	Maximum flow in Aleph-w networks (Ford-Fulkerson) + max-flow reductions (matching).
	ntreepic.C
	Generate LaTeX/eepic pictures of n-ary (general) trees.
	ntt_example.cc
	Demonstrates the industrial NTT and CRT exact APIs.
	parse_csv_example.cc
	Educational examples for CSV parsing and manipulation.
	patricia_trie_example.cc
	Fixed-width unsigned integer lookup with Aleph::PatriciaSet and Aleph::PatriciaMap.
	percolation_example.C
	Percolation Simulation using Union-Find.
	persistent_containers_example.cc
	Small example for Aleph persistent in-memory containers.
	persistent_hash_map_example.cc
	Basic operations and structural sharing for Aleph::PersistentHashMap.
	planarity_test_example.cc
	Example usage of planarity test on Aleph graphs.
	point_in_polygon_example.cc
	Point-in-polygon classification with winding number.
	polinom.C
	Polynomial arithmetic demonstration using sparse representation.
	polygon_intersection_example.cc
	Convex polygon intersection demo (Sutherland-Hodgman).
	polygon_offset_example.cc
	Demonstrates PolygonOffset on convex and non-convex polygons.
	polygon_simplification_example.cc
	Demonstrates Douglas-Peucker and Visvalingam-Whyatt simplification with TikZ output.
	polynomial_benchmark.cc
	Reproducible benchmark and validation utility for tpl_polynomial.H and tpl_multi_polynomial.H.
	polynomial_example.cc
	Polynomial arithmetic in Aleph-w: construction, algebra, calculus, interpolation, and applications.
	polynomial_reference_probe.cc
	Emits deterministic polynomial workloads/results as JSON for optional differential checks against external CAS tools.
	print_rule.H
	quadtree_example.C
	QuadTree: Spatial Data Structure for 2D Points.
	quotient_filter_example.C
	Quotient filter in Aleph-w: probabilistic set with deletion support.
	r_tree_example.cc
	Dynamic spatial indexing with Aleph::RTree.
	rabin_karp_example.cc
	Illustrative example for Rabin-Karp matching.
	radix_tree_example.cc
	Word lookup, prefix autocomplete, and longest-prefix match with Aleph::RadixTree.
	random_graph_example.C
	Example demonstrating random graph generation in Aleph-w.
	random_select_example.cc
	Demonstrates the use of Aleph's random_select algorithm.
	ranges_example.C
	Example demonstrating C++20 Ranges support in Aleph-w.
	robust_predicates_example.cc
	Demonstrates robust geometry predicates using exact arithmetic.
	rope_benchmark.cc
	Benchmarks Aleph::Rope against std::string for the two access patterns each type is respectively built for.
	rope_example.cc
	Basic operations, structural sharing, and text-editing usage of Aleph::Rope.
	rotating_calipers_example.cc
	Diameter and minimum width of a convex polygon.
	segment_segment_intersection_example.cc
	Dedicated O(1) segment-segment intersection demo.
	segment_tree_example.cc
	Four creative scenarios demonstrating Segment Tree variants.
	set_structures_benchmark.cc
	Comprehensive benchmark comparing all set data structures in Aleph-w.
	simplex_example.C
	Simplex Algorithm: Linear Programming Optimization.
	skiplist_example.C
	Skip List: A probabilistic alternative to balanced trees.
	sort_benchmark.C
	Comprehensive benchmark for Aleph-w sorting algorithms.
	sparse_table_example.cc
	Sparse Table applied to competitive programming and sensor analysis.
	sparse_table_test.cc
	Comprehensive test suite for Sparse Table implementation.
	ssa_example.cc
	Minimal example that lowers explicit IR into SSA form.
	state_search_benchmark.cc
	Reproducible benchmark suite for the state-space search framework.
	state_search_framework_example.cc
	Reference example: minimal artificial decision tree with DFS.
	stl_utils_example.C
	Example demonstrating STL <-> Aleph-w container conversions.
	string_utils_example.C
	Example demonstrating string manipulation utilities in Aleph-w.
	subset_sum_example.cc
	Illustrated subset-sum scenarios (DP + MITM).
	suffix_array_lcp_example.cc
	Illustrative example for suffix array + LCP (Kasai).
	suffix_automaton_example.cc
	Illustrative example for suffix automaton.
	suffix_tree_example.cc
	Illustrative example for the naive compressed suffix tree.
	tarjan_example.C
	Tarjan's Algorithm: Finding Strongly Connected Components.
	test-comb.C
	test-con-queue.C
	test-convexhull-time.C
	test-dry.C
	test-emplace.C
	test-forward.C
	test-memarray.C
	test-odhash.cc
	test-pair-it.C
	test-quadtree.C
	test-rvalues.C
	test-splice.C
	test-tree-itor.C
	test-zip-it.cc
	test_2dtree.C
	test_bin_to_tree.C
	test_eepicgeom.C
	test_format.cc
	test_gen_tree.C
	test_htlist.C
	test_huffman.C
	test_karger.C
	test_random_search.C
	test_search.C
	test_search_deway.C
	test_sort_lists.C
	test_splay_tree.C
	test_splayRk.C
	test_tree_node.C
	testAllTree.C
	testArrayHeap.C
	testArrayQueue.C
	testAvl.C
	testBalance.C
	testBinHeap.C
	testBinHeapPtr.C
	testBinNodeUtils.C
	testBinNodeXt.C
	testBinTree.C
	testBitArray.C
	testDnode.C
	testDynArray.C
	testDynBinHeap.C
	testDynDlist.C
	testDynHash.C
	testDynListQueue.C
	testDynListStack.C
	testDynSetHash.C
	testDynSetTree.C
	testDynSlist.C
	testFunctional.C
	testHash.C
	testInsertRoot.C
	testJoin.C
	testLinHash.C
	testLuka.C
	testMerge.C
	testOhash.C
	testOpBinTree.C
	testQueue.C
	testSlink.C
	testSlist.C
	testSnode.C
	testSplayRk1.C
	testSplayTree.C
	testSplit.C
	testTreap.C
	testTreapRk.C
	thread_pool_example.cc
	Comprehensive ThreadPool Usage Examples: Parallel Task Execution.
	tikz_advanced_algorithms_example.cc
	tikz_computational_geometry_gallery_example.cc
	tikz_convex_hull_example.cc
	tikz_funnel_animation_example.cc
	tikz_funnel_beamer_example.cc
	tikz_funnel_beamer_handout_example.cc
	tikz_funnel_beamer_twocol_example.cc
	tikz_intersection_example.cc
	tikz_missing_primitives_example.cc
	tikz_polygons_example.cc
	tikz_render_features_example.cc
	tikz_scene_beamer_example.cc
	tikz_scene_example.cc
	tikz_scene_overlays_example.cc
	tikz_tree_structures_example.cc
	tikz_visibility_calipers_example.cc
	tikz_voronoi_power_example.cc
	timeAllTree.C
	Benchmark Aleph-w binary search trees (timed insert/remove + height/IPL across powers of 2).
	timeoutQueue_example.C
	Example demonstrating TimeoutQueue usage for timed event scheduling.
	topological_sort_example.C
	Topological Sort: Ordering tasks with dependencies.
	tpl_2dtree_example.cc
	Educational examples for 2D spatial trees (k-d trees)
	tpl_dynMat_example.cc
	Educational examples for dynamic matrices with automatic resizing.
	tpl_euclidian_graph_example.cc
	Educational examples for Euclidean graphs with geometric positions.
	tpl_indexArc_example.cc
	Educational examples for arc indexing (fast arc lookup)
	tpl_indexGraph_example.cc
	Educational examples for indexed graphs (fast O(log n) lookups)
	tpl_indexNode_example.cc
	Educational examples for indexed nodes (O(log n) node search)
	tpl_kgraph_example.cc
	Educational examples for k-connected graphs and connectivity analysis.
	tpl_multicommodity_example.cc
	Educational examples for multi-commodity flow networks.
	tpl_net_sup_dem_example.cc
	Educational examples for supply-demand network flow problems.
	tpl_netcapgraph_example.cc
	Educational examples for capacity-constrained flow networks.
	trapezoidal_map_example.cc
	Demonstrates TrapezoidalMapPointLocation with an L-shaped polygon.
	tree_dp_example.cc
	Illustrated tree DP + rerooting walkthrough.
	tree_node_graphviz_example.cc
	trie_example.C
	Prefix Tree (Trie): Efficient String Storage and Search.
	two_sat_example.cc
	Examples of the Two_Sat solver.
	uni_functional_example.C
	Unified functional programming for mixed STL/Aleph containers.
	union_find_example.C
	Disjoint Set Union (Union-Find) data structure demonstration.
	voronoi_clipped_cells_example.cc
	Demonstrates clipped, site-indexed Voronoi cells.
	weighted_blossom_example.cc
	Maximum-weight matching in general graphs (weighted blossom).
	write_floyd.C
	Floyd-Warshall algorithm with LaTeX output generation.
	write_huffman.C
	Huffman encoding/decoding demonstration with tree visualization.
	write_tree.C
	Generates tree structure files for visualization and analysis.
	writeAllTrees.C
	writeAvl.C
	writeBalance.C
	Demonstrates BST balancing operation (recursive median selection with rotations)
	writeBinTree.C
	writeHeap.C
	Demonstrates array-based heap structure and generates visualization files.
	writeInsertRoot.C
	Demonstrates root insertion in BST.
	writeJoin.C
	Demonstrates BST join operation and generates visualization files.
	writeRankTree.C
	Ranked BST demo using BinNodeXt subtree sizes (select/order-statistics + visualization output).
	writeRb.C
	writeSplay.C
	writeSplit.C
	Demonstrates BST split by position operation.
	writeTreap.C
	z_algorithm_example.cc
	Illustrative example for Z-algorithm pattern matching.
	zero_one_bfs_example.cc
	zip_example.C
	Comprehensive example of zip operations in Aleph-w.
	zip_utils_example.C
	Unified zip operations for mixed STL/Aleph containers.