Expand description
Compact graph representations for memory efficiency
This module provides memory-efficient graph storage formats optimized for different graph characteristics (sparse, dense, regular degree, etc.).
Structs§
- BitPacked
Graph - Bit-packed representation for unweighted graphs
- CSRGraph
- Compressed Sparse Row (CSR) format for sparse graphs
- Compressed
Adjacency List - Compressed adjacency list using variable-length encoding
- Memmap
Graph - Memory-mapped graph for extremely large graphs that don’t fit in RAM
Enums§
- Hybrid
Graph - Hybrid graph representation that chooses optimal format based on graph properties