Module pool 

Pool Allocators and Lazy Level Deallocation

Memory-efficient allocation strategies:

• Pool allocators for frequent allocations
• Lazy deallocation of unused j-tree levels
• Compact representations (u16 for small graphs)
• Demand-paged level materialization

Target: 50-75% memory reduction

Structs

CompactAdjacency

Compact adjacency list using u16 vertex IDs

CompactVertexMapper

Vertex ID converter for compact representations

LevelData

Data stored for a j-tree level

LevelPool

Pool allocator for j-tree levels

PoolConfig

Configuration for level pool

PoolStats

Statistics for pool allocation

Enums

LazyLevel

State of a lazy level in the j-tree