Algorithm Catalog & Compatibility Matrix

View Source

This document maps all algorithms implemented in YogEx and shows their implementation status in Zog, including native performance notes and future roadmap details.

1. Pathfinding

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
DijkstraYog.Pathfinding.DijkstraSingle-source shortest path (non-negative weights)✅ ImplementedNative Zig via Zog.Pathfinding.dijkstra/3.
A*Yog.Pathfinding.AStarHeuristic-guided shortest path✅ ImplementedNative Zig via Zog.Pathfinding.astar/6. Supports Euclidean, Manhattan, and Chebyshev heuristics.
Bellman-FordYog.Pathfinding.BellmanFordShortest path with negative weights, cycle detection✅ ImplementedNative Zig via Zog.Pathfinding.bellman_ford/3.
Floyd-WarshallYog.Pathfinding.FloydWarshallAll-pairs shortest paths✅ ImplementedNative Zig via Zog.Pathfinding.floyd_warshall/1.
Johnson'sYog.Pathfinding.JohnsonAll-pairs shortest paths in sparse graphs✅ ImplementedNative Zig via Zog.Pathfinding.johnsons/1.
Bidirectional DijkstraYog.Pathfinding.BidirectionalFaster single-pair shortest path❌ MissingWIP/Roadmap — planned for a future native pathfinding update.
Bidirectional BFSYog.Pathfinding.BidirectionalUnweighted shortest path❌ MissingWIP/Roadmap — planned for a future native pathfinding update.
Yen's K-ShortestYog.Pathfinding.Yenk shortest loopless paths❌ MissingDeferred — low priority, can be implemented if there is demand.
Widest PathYog.PathfindingMaximum bottleneck capacity path❌ MissingDeferred — low priority.
Unweighted SSSPYog.PathfindingBFS shortest path (no heap)❌ MissingDeliberately Omitted — standard Dijkstra handles this efficiently; separate unweighted SSSP is unneeded.
Brandes SSSPYog.Pathfinding.BrandesSingle-source dependency accumulation❌ MissingOmitted — internally used within Betweenness Centrality, not exposed as a public API.
Chinese PostmanYog.Pathfinding.ChinesePostmanShortest route visiting every edge❌ MissingDeferred — complex to implement natively; low priority.
LCA (Binary Lifting)Yog.Pathfinding.LCALowest common ancestor in trees❌ MissingDeferred — low priority.
Path UtilitiesYog.Pathfinding.PathPath reconstruction and manipulation❌ MissingOmitted — path reconstruction is handled internally in Zig before returning to Elixir.
Distance MatrixYog.Pathfinding.MatrixMatrix-based distance operations❌ MissingDeliberately Omitted — flat array conversions are handled at the NIF boundary.
All-Pairs UnweightedYog.PathfindingParallel BFS all-pairs shortest paths❌ MissingDeferred — Floyd-Warshall and Johnson's are sufficient for now.

2. Flow & Cuts

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
Edmonds-KarpYog.Flow.MaxFlowMaximum flow (BFS augmenting paths)✅ ImplementedNative Zig via Zog.Flow.max_flow/4 (default).
Dinic'sYog.Flow.MaxFlowMaximum flow (blocking flow)❌ MissingDeliberately Omitted — Zog implements Push-Relabel instead, which is generally faster.
Push-RelabelN/A (Zog exclusive)High-performance max flow (preflow-push)✅ ImplementedNative Zig via Zog.Flow.max_flow/4 with [algorithm: :push_relabel].
Successive Shortest PathYog.Flow.SuccessiveShortestPathMin-cost max-flow❌ MissingWIP/Roadmap — planned for future network flow releases.
Stoer-WagnerYog.Flow.MinCutGlobal minimum cut✅ ImplementedNative Zig via Zog.Flow.global_min_cut/1.

3. Spanning Tree

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
Kruskal'sYog.MSTMST via edge sorting✅ ImplementedNative Zig via Zog.MST.kruskal/1.
Prim'sYog.MSTMST via vertex growing❌ MissingDeliberately Omitted — Kruskal's is sufficient for MST; Prim's offers no major advantage here.
Borůvka'sYog.MSTParallel MST❌ MissingWon't Have — Kruskal's is sufficient.
Edmonds'Yog.MSTMinimum Spanning Arborescence (Directed)❌ MissingDeferred — low priority.
Wilson'sYog.MSTUniform Spanning Tree (Probabilistic)❌ MissingWon't Have — outside project scope.
Max Spanning TreeYog.MSTMaximum weight tree❌ MissingDeferred — can be achieved by negating weights and using Kruskal's.

4. Matching

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
Hopcroft-KarpYog.MatchingMaximum bipartite matching✅ ImplementedNative Zig via Zog.Connectivity.maximum_bipartite_matching/1 and Zog.ResourceGraph.maximum_bipartite_matching/2.
HungarianYog.MatchingWeighted bipartite matching❌ MissingWIP/Roadmap — planned for v0.3.0.
BlossomYog.MatchingMaximum matching in general graphs❌ MissingWIP/Roadmap — planned for v0.3.0.

5. Connectivity & Components

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
Tarjan's SCCYog.ConnectivityStrongly connected components✅ ImplementedNative Zig via Zog.Connectivity.strongly_connected_components/1.
Kosaraju's SCCYog.ConnectivityStrongly connected components (two-pass)❌ MissingDeliberately Omitted — Tarjan's SCC is faster and already implemented.
Connected ComponentsYog.ConnectivityUndirected connected components❌ MissingDeliberately Omitted — can be resolved via SCC on undirected graphs.
Weakly Connected ComponentsYog.Connectivity.ComponentsDirected components ignoring direction✅ ImplementedNative Zig via Zog.Connectivity.weakly_connected_components/1 and Zog.ResourceGraph.weakly_connected_components/2.
Tarjan's BridgesYog.Connectivity.AnalysisBridge edges✅ ImplementedNative Zig via Zog.Connectivity.analyze/1.
Tarjan's ArticulationYog.Connectivity.AnalysisArticulation points✅ ImplementedNative Zig via Zog.Connectivity.analyze/1.
K-CoreYog.Connectivity.KCoreCore decomposition✅ ImplementedNative Zig via Zog.Connectivity.core_numbers/1 and Zog.Connectivity.detect/2.
Reachability ExactYog.Connectivity.ReachabilityAncestor/descendant counting❌ MissingDeferred — low priority.
Reachability HLLYog.Connectivity.ReachabilityHyperLogLog reachability estimation❌ MissingWon't Have — unneeded, HLL estimation is less critical given native memory limits.

6. Centrality Measures

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
Degree CentralityYog.CentralitySimple connectivity importance❌ MissingDeliberately Omitted — trivial to query directly in Elixir from graph nodes/edges.
Closeness CentralityYog.CentralityDistance-based importance✅ ImplementedNative Zig via Zog.Centrality.closeness_f64/1.
Harmonic CentralityYog.CentralityDistance-based (handles infinite)✅ ImplementedNative Zig via Zog.Centrality.harmonic_centrality_f64/1.
Betweenness CentralityYog.CentralityBridge/gatekeeper detection✅ ImplementedNative Zig via Zog.Centrality.betweenness_unweighted/1 and Zog.Centrality.betweenness_f64/1.
PageRankYog.CentralityLink-quality importance✅ ImplementedNative Zig via Zog.Centrality.pagerank/2.
HITSYog.CentralityHub and authority scores❌ MissingDeferred — low priority.
Eigenvector CentralityYog.CentralityInfluence from neighbors✅ ImplementedNative Zig via Zog.Centrality.eigenvector/2.
Katz CentralityYog.CentralityAttenuated influence propagation✅ ImplementedNative Zig via Zog.Centrality.katz/2.
Alpha CentralityYog.CentralityExternal influence model✅ ImplementedNative Zig via Zog.Centrality.alpha_centrality/2.

7. Community Detection

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
LouvainYog.Community.LouvainModularity optimization✅ ImplementedNative Zig via Zog.Community.louvain/2.
LeidenYog.Community.LeidenQuality-guaranteed communities✅ ImplementedNative Zig via Zog.Community.leiden/2 and Zog.Community.leiden_hierarchical/2.
Label PropagationYog.Community.LabelPropagationVery large graphs, speed✅ ImplementedNative Zig via Zog.Community.label_propagation/2.
WalktrapYog.Community.WalktrapRandom-walk communities❌ MissingDeferred — low priority.
InfomapYog.Community.InfomapInformation-theoretic❌ MissingDeferred — low priority.
Girvan-NewmanYog.Community.GirvanNewmanHierarchical edge betweenness❌ MissingDeferred — high complexity O(E²V); unfeasible for larger graphs.
Clique PercolationYog.Community.CliquePercolationOverlapping communities❌ MissingDeferred — low priority.
Fluid CommunitiesYog.Community.FluidCommunitiesExact k partitions❌ MissingDeferred — low priority.
Local CommunityYog.Community.LocalCommunitySeed expansion❌ MissingDeferred — low priority.

8. Community Metrics

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
TransitivityYog.Community.MetricsGlobal clustering coefficient❌ MissingDeferred — average clustering coefficient is usually sufficient.
Local Clustering CoefficientYog.CommunityPer-node clustering coefficient✅ ImplementedNative Zig via Zog.Metrics.local_clustering_coefficient/1.
Average Clustering CoefficientYog.CommunityGlobal average clustering✅ ImplementedNative Zig via Zog.Metrics.average_clustering_coefficient/1.
Triangle CountYog.CommunityGlobal or per-node triangles✅ ImplementedNative Zig via Zog.Metrics.triangle_count/1.
Community DensityYog.CommunityPer-community edge density✅ ImplementedNative Zig via Zog.Metrics.density/1.
ModularityYog.CommunityPartition quality score✅ ImplementedNative Zig via Zog.Community.modularity/2.
AlgorithmYogEx ModulePurposeZog StatusNotes / Details
BFSYog.TraversalBreadth-first exploration❌ MissingDeliberately Omitted — BFS traversal is done internally in Zig; not exposed as a public API.
DFSYog.TraversalDepth-first exploration❌ MissingDeliberately Omitted — DFS traversal is done internally in Zig; not exposed as a public API.
Topological SortYog.TraversalDAG vertex ordering❌ MissingWIP/Roadmap — planned for a future DAG-focused release.
Find PathYog.TraversalAny path between nodes❌ MissingDeliberately Omitted — shortest path algorithms (Dijkstra/BFS) handle path finding.
Implicit SearchYog.Traversal.ImplicitOn-demand graph traversal❌ MissingWon't Have — FGL/lazy evaluation concepts do not fit Zog's memory model.
Kahn's AlgorithmYog.Traversal.SortTopological sort (BFS-based)❌ MissingWIP/Roadmap — planned for a future DAG release.
Lexicographical TopSortYog.Traversal.SortDeterministic topological ordering❌ MissingWon't Have — low priority.
Best-First WalkYog.Traversal.WalkPriority-guided traversal❌ MissingWon't Have — low priority.
Random WalkYog.Traversal.WalkStochastic path exploration❌ MissingDeferred — low priority.
BFS PathYog.Traversal.WalkBFS shortest path between nodes❌ MissingDeliberately Omitted — Dijkstra handles shortest paths.

10. Graph Transformations

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
TransposeYog.TransformReverse edge directions❌ MissingDeliberately Omitted — transpose logic is handled at graph build time.
SubgraphYog.TransformInduced subgraph by node IDs✅ ImplementedZog.Transform.subgraph/2 and Zog.ResourceGraph.subgraph/3 (native Zig).
Ego GraphYog.Transformk-hop neighborhood subgraph✅ ImplementedZog.Transform.ego_graph/3 and Zog.ResourceGraph.ego_graph/3.
Transitive ClosureYog.TransformReachability graph✅ ImplementedZog.Transform.transitive_closure/1 and Zog.ResourceGraph.transitive_closure/2.
Transitive ReductionYog.TransformMinimal equivalent DAG✅ ImplementedZog.Transform.transitive_reduction/1 and Zog.ResourceGraph.transitive_reduction/2.
Quotient GraphYog.TransformPartition-based contraction❌ MissingWon't Have — low priority.
ContractYog.TransformMerge two nodes✅ ImplementedZog.Transform.contract/3 and Zog.ResourceGraph.contract/4.
Filter NodesYog.TransformPredicate-based subgraph❌ MissingDeferred — low priority.
Filter EdgesYog.TransformPredicate-based edge removal❌ MissingDeferred — low priority.

11. Graph Properties

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
Bipartite CheckYog.Property.Bipartite2-colorability test✅ ImplementedNative Zig via Zog.Connectivity.bipartite_check/1 and Zog.ResourceGraph.bipartite_check/2.
Bipartite PartitionYog.Property.BipartiteTwo-color assignment✅ ImplementedNative Zig via Zog.Connectivity.bipartite_partition/1 and Zog.ResourceGraph.bipartite_partition/2.
Max Bipartite MatchingYog.Property.BipartiteMaximum matching✅ ImplementedNative Zig via Zog.Connectivity.maximum_bipartite_matching/1 and Zog.ResourceGraph.maximum_bipartite_matching/2 (Hopcroft-Karp).
Stable MarriageYog.Property.BipartiteGale-Shapley stable matching❌ MissingWon't Have — outside core graph project scope.
Acyclicity TestYog.Property.CyclicityCycle detection❌ MissingWIP/Roadmap — planned for a future DAG release.
Eulerian CircuitYog.Property.EulerianEulerian cycle existence❌ MissingDeferred — low priority.
Eulerian PathYog.Property.EulerianEulerian path existence❌ MissingDeferred — low priority.
Bron-KerboschYog.Property.CliqueAll maximal cliques✅ ImplementedNative Zig via Zog.Property.all_maximal_cliques/1.
Max CliqueYog.Property.CliqueLargest clique✅ ImplementedZog.Property.max_clique/1 (filtered from Bron-Kerbosch).
Complete GraphYog.Property.StructureKₙ detection❌ MissingDeferred — low priority.
Tree CheckYog.Property.StructureTree verification❌ MissingDeferred — low priority.
Forest CheckYog.Property.StructureDisjoint trees❌ MissingDeferred — low priority.
Branching CheckYog.Property.StructureDirected forest❌ MissingDeferred — low priority.
Planarity TestYog.Property.StructureExact LR-test planarity❌ MissingWon't Have — highly complex; outside core project scope.
Planar EmbeddingYog.Property.StructureCombinatorial embedding❌ MissingWon't Have — outside core project scope.
Kuratowski WitnessYog.Property.StructureNon-planar subgraph❌ MissingWon't Have — outside core project scope.
Chordality TestYog.Property.StructureChordal graph verification❌ MissingWon't Have — outside core project scope.
Graph ColoringYog.Property.ColoringGreedy and exact coloring✅ ImplementedNative Zig via Zog.Property.coloring_dsatur/1 and Zog.Property.coloring_exact/2.
Tree DecompositionYog.Property.TreeDecompositionValidity check/construction❌ MissingWon't Have — outside core project scope.
IsomorphismYog.PropertyWeisfeiler-Lehman equality❌ MissingDeferred — low priority.
Graph HashYog.PropertyStructural fingerprint❌ MissingDeferred — low priority.

12. DAG Algorithms

Note: Dedicated DAG optimizations are planned for future releases. Standard graph pathfinding handles basic cases for now.

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
Longest PathYog.DAG.AlgorithmCritical path in weighted DAG❌ MissingDeferred — low priority.
Shortest PathYog.DAG.AlgorithmShortest path in DAG❌ MissingDeliberately Omitted — standard pathfinding handles this.
Transitive ClosureYog.TransformReachability matrix❌ MissingDeferred — low priority.
Transitive ReductionYog.TransformMinimal equivalent DAG❌ MissingDeferred — low priority.
LCAYog.Pathfinding.LCALowest common ancestors❌ MissingDeferred — low priority.
Topological GenerationsYog.DAGLayer-by-layer ordering❌ MissingDeferred — low priority.
SourcesYog.DAGIn-degree 0 nodes❌ MissingDeferred — low priority.
SinksYog.DAGOut-degree 0 nodes❌ MissingDeferred — low priority.
AncestorsYog.DAGAll ancestors of a node❌ MissingDeferred — low priority.
DescendantsYog.DAGAll descendants of a node❌ MissingDeferred — low priority.
Single-Source DistancesYog.DAGSSSP in DAG❌ MissingDeliberately Omitted — standard pathfinding handles this.
Path CountYog.DAGNumber of distinct paths❌ MissingDeferred — low priority.

13. Graph Operations

Note: Standard graph operations are generally left to Elixir to process or build via SoA structures rather than native Zig conversions.

Algorithm / OpYogEx ModulePurposeZog StatusNotes / Details
UnionYog.OperationGraph union❌ MissingDeliberately Omitted — easily done in Elixir during SoA compilation.
IntersectionYog.OperationGraph intersection❌ MissingDeliberately Omitted — easily done in Elixir.
DifferenceYog.OperationGraph difference❌ MissingDeliberately Omitted — easily done in Elixir.
Symmetric DifferenceYog.OperationXOR of graphs❌ MissingDeliberately Omitted — easily done in Elixir.
Cartesian ProductYog.OperationGraph product❌ MissingDeferred — low priority.
Power GraphYog.Operationk-th power❌ MissingDeferred — low priority.
Line GraphYog.OperationEdge-to-vertex dual❌ MissingDeferred — low priority.
TransposeYog.OperationReverse all edges❌ MissingDeliberately Omitted — easily done in Elixir/SoA.
IsomorphismYog.OperationGraph equality❌ MissingDeferred — low priority.
SubgraphYog.OperationInduced subgraph✅ ImplementedSame as Zog.Transform.subgraph/2.
Subgraph CheckYog.OperationSubgraph relationship❌ MissingDeferred — low priority.
Graph CompositionYog.OperationRelational graph composition❌ MissingWon't Have — outside project scope.
Graph ComplementYog.OperationInverse edge set❌ MissingDeferred — low priority.
Disjoint UnionYog.OperationUnion with re-indexing❌ MissingDeliberately Omitted — easily done in Elixir.
Map NodesYog.OperationTransform node data❌ MissingDeliberately Omitted — nodes are arbitrarily labeled in Elixir.
Map EdgesYog.OperationTransform edge weights❌ MissingDeliberately Omitted — easily mapped in Elixir.
Filter NodesYog.OperationFilter-based node removal❌ MissingDeferred — low priority.
Filter EdgesYog.OperationFilter-based edge removal❌ MissingDeferred — low priority.
Relabel NodesYog.OperationRename node IDs❌ MissingDeliberately Omitted — labels are managed in Elixir.

14. Multigraph

Note: Zog currently only supports simple directed or undirected graphs. Multigraphs are planned for the v0.5.0 release.

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
Eulerian CircuitYog.Multi.EulerianHierholzer with edge IDs❌ MissingWIP/Roadmap — planned for v0.5.0.
Eulerian PathYog.Multi.EulerianOpen Eulerian walk❌ MissingWIP/Roadmap — planned for v0.5.0.
BFSYog.Multi.TraversalEdge-ID aware BFS❌ MissingWIP/Roadmap — planned for v0.5.0.
DFSYog.Multi.TraversalEdge-ID aware DFS❌ MissingWIP/Roadmap — planned for v0.5.0.
Fold WalkYog.Multi.TraversalStateful traversal❌ MissingWIP/Roadmap — planned for v0.5.0.
Cycle CheckYog.MultiMultigraph cycle detection❌ MissingWIP/Roadmap — planned for v0.5.0.
Topological SortYog.MultiMultigraph topological ordering❌ MissingWIP/Roadmap — planned for v0.5.0.
To Simple GraphYog.MultiCollapse parallel edges❌ MissingWIP/Roadmap — planned for v0.5.0.

15. Health Metrics

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
DiameterYog.HealthLongest shortest path❌ MissingWIP/Roadmap — planned for a future metrics update.
RadiusYog.HealthMinimum eccentricity❌ MissingWIP/Roadmap — planned for a future metrics update.
EccentricityYog.HealthMax distance from node❌ MissingWIP/Roadmap — planned for a future metrics update.
AssortativityYog.HealthDegree correlation✅ ImplementedNative Zig via Zog.Metrics.assortativity/1.
ANF & Effective DiameterN/A (Zog exclusive)Approximate Neighborhood Function and 90% effective diameter✅ ImplementedNative Zig via Zog.Metrics.anf/2 and Zog.ResourceGraph.anf/2.
APLYog.HealthAverage path length❌ MissingWIP/Roadmap — planned for a future metrics update.
Global EfficiencyYog.HealthInverse mean distance❌ MissingDeferred — low priority.
Local EfficiencyYog.HealthNeighborhood efficiency❌ MissingDeferred — low priority.

16. Random Graph Generation

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
Erdős-Rényi (GNP)Yog.Generator.RandomFixed probability per edge✅ ImplementedNatively generated via Zog.Generator.erdos_renyi/3 (using linear-time Batagelj-Brandes).
Erdős-Rényi (GNM)Yog.Generator.RandomFixed number of edges❌ MissingDeferred — GNP is sufficient for most random graph generation.
Barabási-AlbertYog.Generator.RandomPreferential attachment✅ ImplementedNatively generated via Zog.Generator.barabasi_albert/3.
Watts-StrogatzYog.Generator.RandomSmall-world networks✅ ImplementedNatively generated via Zog.Generator.watts_strogatz/4.
Random TreeYog.Generator.RandomUniform random tree❌ MissingDeferred — low priority.
Random RegularYog.Generator.RandomFixed-degree random graph❌ MissingDeferred — low priority.
SBMYog.Generator.RandomStochastic Block Model❌ MissingDeferred — low priority.
DCSBMYog.Generator.RandomDegree-Corrected SBM❌ MissingDeferred — low priority.
HSBMYog.Generator.RandomHierarchical SBM❌ MissingDeferred — low priority.
Configuration ModelYog.Generator.RandomGiven degree sequence❌ MissingDeferred — low priority.
Power Law GraphYog.Generator.RandomScale-free network❌ MissingDeferred — low priority.
KroneckerYog.Generator.RandomRecursive matrix product❌ MissingWon't Have — outside core scope.
R-MATYog.Generator.RandomRecursive matrix model❌ MissingWon't Have — outside core scope.
GeometricYog.Generator.RandomDistance-threshold graph❌ MissingDeferred — low priority.
WaxmanYog.Generator.RandomProbabilistic distance graph❌ MissingDeferred — low priority.

17. Classic Graph Generators

GeneratorYogEx ModulePurposeZog StatusNotes / Details
Grid 2DYog.Generator.ClassicRectangular lattice✅ ImplementedNatively generated via Zog.Generator.grid_2d/3.
Others (Complete, Cycle, Path, Star, Wheel, Peterson, Crown, Hypercube, Platonic, Friendship, Book, Turán, platonic solids)Yog.Generator.ClassicClassic topology generation❌ MissingDeferred — low priority; grid_2d is the most commonly used. Complete/Cycle/Path are easily constructed via Elixir.

18. Graph Builders

BuilderYogEx ModulePurposeZog StatusNotes / Details
Grid / ToroidalYog.BuilderLattice construction❌ MissingDeliberately Omitted — unneeded, handled via grid_2d generators.
Labeled / Live BuildersYog.BuilderIncremental building❌ MissingOmitted — Zog utilizes the SoA struct for builder patterns.

19. Functional Graphs (FGL-style)

FeatureYogEx ModulePurposeZog StatusNotes / Details
Inductive Decomposition / Context Embedding / AlgorithmsYog.FunctionalInductive functional graph operations❌ MissingDeliberately Omitted — Zog is built on mutable ArrayGraph/GraphMap representations in native Zig for speed, which are fundamentally incompatible with FGL-style inductive models.

20. Rendering

FormatYogEx ModulePurposeZog StatusNotes / Details
ASCII RenderYog.Render.ASCIITerminal visualization❌ MissingDeferred — client-side rendering is preferred.
DOT ExportYog.Render.DOTGraphviz DOT format❌ MissingDeferred — easily implemented in Elixir; low priority.
Mermaid ExportYog.Render.MermaidMermaid.js diagram format❌ MissingDeferred — easily implemented in Elixir; low priority.

21. Data Structures

StructureYogEx ModulePurposeZog StatusNotes / Details
Pairing HeapYog.PairingHeapPriority queue❌ MissingDeliberately Omitted — Zig's standard std.PriorityQueue is used natively; no need to expose an Elixir heap module.
Disjoint SetYog.DisjointSetUnion-Find❌ MissingDeliberately Omitted — handled internally in native code.
HyperLogLogYog.ConnectivityCardinality estimation❌ MissingWon't Have — unneeded.

22. Maze Generation

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
Maze generation (Binary Tree, Sidewinder, backtracker, Hunt-and-Kill, Aldous-Broder, Eller's, division, Kruskal/Prim)Yog.Generator.MazeGraph-based mazes❌ MissingWon't Have — deliberately out of scope for Zog's core graph library.

23. Approximation Algorithms

AlgorithmYogEx ModulePurposeZog StatusNotes / Details
Approximation (Diameter, Betweenness, Avg Path, Efficiency, Transitivity, Clique, Cover)Yog.ApproximateApproximate scaling algorithms❌ MissingDeferred — Zog runs exact algorithms natively. Approximation might be added in future scalability updates.

24. I/O & Serialization

FormatYogEx ModulePurposeZog StatusNotes / Details
EdgelistYog.IOSpace-separated edges✅ ImplementedSupported via Zog.IO.load/2 and Zog.IO.dump/3.
CSVYog.IOComma-separated edges✅ ImplementedSupported via Zog.IO.load/2 and Zog.IO.dump/3.
PajekYog.IO.net format✅ ImplementedSupported via Zog.IO.dump/3 (writing only).
TGFYog.IOTrivial Graph Format✅ ImplementedSupported via Zog.IO.load/2 and Zog.IO.dump/3.
AdjlistYog.IOAdjacency list format✅ ImplementedSupported via Zog.IO.load/2 and Zog.IO.dump/3.
Lesser-used (GDF, GEXF, GraphML, Graph6, Sparse6, JSON, LEDA, Matrix Market, Libgraph)Yog.IOVarious serialization formats❌ MissingDeferred — only the most common standard formats are implemented in Zog.