Module graph 

Graph algorithms — BFS traversal, community detection, neighborhood queries.

Modules

community

Louvain community detection with deterministic seeding.

query

BFS reachability search and orphan/stub detection.

relations

PART_OF hierarchy traversal — ancestors and descendants.

topology

Bulk per-mem topology projection — {nodes, edges, communities} for one mem, in one call, coordinate-free.

Structs

ClusterInfo

Info about a single community cluster.

CommunityBridge

Inter-cluster edge aggregation. Pair keys are lexicographically normalised (from_cluster <= to_cluster), so each unordered cluster pair appears at most once. sample_edges carries the directed tuples as they exist in the store, capped at BRIDGE_SAMPLE_CAP.

LouvainOutput

Output of Louvain community detection: clusters, reverse lookup, and quality metrics. Computed on demand by Engine::communities() and cached in an in-memory memo that is invalidated whenever the graph mutates (see Engine::invalidate_communities).

SampleEdge

A directed sample edge for a CommunityBridge.

Constants

BRIDGE_SAMPLE_CAP

Maximum number of SampleEdge tuples attached to a CommunityBridge.