Examples Directory Reference

Files
	ah_parallel_example.cc
	Parallel functional programming utilities (ah-parallel.H): map/filter/fold/predicates/zip/sort.
	ah_stl_functional_example.cc
	Comprehensive examples of ah-stl-functional.H usage.
	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).
	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).
	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).
	btreepic.C
	Binary tree visualization tool: convert a .Tree description into LaTeX/eepic.
	comb_example.C
	Combinatorics helpers in Aleph-w (ah-comb.H): transpose, Cartesian products, combinations.
	cut_nodes_example.C
	Cut nodes (articulation points) and biconnected components in Aleph-w.
	deway.C
	Dewey ("deway") numbering for tree nodes (path-based hierarchical addresses).
	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.
	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.
	eulerian_example.C
	Eulerian paths/cycles in Aleph-w (eulerian.H) with classic demos and rich visual explanations.
	evalExp.C
	Arithmetic expression evaluator using operator precedence.
	fenwick_tree_example.cc
	Fenwick trees applied to trading and sports betting.
	fib.C
	Fibonacci sequence: Three implementation strategies compared.
	fibonacci.C
	Fibonacci number computation: Three implementation strategies compared.
	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.
	geom_example.C
	Comprehensive example demonstrating Aleph-w's computational geometry.
	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.
	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.
	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.
	karger_example.cc
	Comprehensive educational example for Karger's min-cut algorithm.
	kosaraju_example.cc
	Comprehensive example of Kosaraju's algorithm for SCCs.
	linear_structures_example.C
	Linear data structures: Stack, Queue, DynArray, DynList.
	load_digraph_example.cc
	Educational examples for saving/loading directed graphs from files.
	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.
	matrix_example.C
	Comprehensive example demonstrating sparse matrices and vectors in Aleph-w.
	maxflow_advanced_example.cc
	Advanced Maximum Flow Algorithms Comparison.
	min_cut_example.cc
	Educational examples for minimum cut algorithms.
	min_cut_test.cc
	Comprehensive test suite for min-cut algorithms.
	mincost_flow_example.cc
	Minimum Cost Maximum Flow: Optimization with Cost Constraints.
	mst_example.C
	Minimum Spanning Tree algorithms: Kruskal and Prim.
	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.
	parse_csv_example.cc
	Educational examples for CSV parsing and manipulation.
	percolation_example.C
	Percolation Simulation using Union-Find.
	polinom.C
	Polynomial arithmetic demonstration using sparse representation.
	quadtree_example.C
	QuadTree: Spatial Data Structure for 2D Points.
	random_graph_example.C
	Example demonstrating random graph generation in Aleph-w.
	ranges_example.C
	Example demonstrating C++20 Ranges support in Aleph-w.
	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.
	stl_utils_example.C
	Example demonstrating STL <-> Aleph-w container conversions.
	string_utils_example.C
	Example demonstrating string manipulation utilities in Aleph-w.
	tarjan_example.C
	Tarjan's Algorithm: Finding Strongly Connected Components.
	thread_pool_example.cc
	Comprehensive ThreadPool Usage Examples: Parallel Task Execution.
	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.
	trie_example.C
	Prefix Tree (Trie): Efficient String Storage and Search.
	uni_functional_example.C
	Unified functional programming for mixed STL/Aleph containers.
	union_find_example.C
	Disjoint Set Union (Union-Find) data structure demonstration.
	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.
	writeBalance.C
	Demonstrates BST balancing operation (recursive median selection with rotations)
	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).
	writeSplit.C
	Demonstrates BST split by position operation.
	zip_example.C
	Comprehensive example of zip operations in Aleph-w.
	zip_utils_example.C
	Unified zip operations for mixed STL/Aleph containers.