Module graph_theory

Expand description

Advanced graph theory analysis for NQuin graphs.

This module exposes two graph-analysis tiers:

analyze_graph_topology_bounded is the preferred zero-heap path for 10D tensor orchestration and edge inference. It uses fixed-capacity arrays only.
analyze_graph_topology is the quarantined compatibility path for bounded, batch-style topology jobs. It still uses HashMap, HashSet, Vec, and VecDeque, so callers must keep it off hot paths and within the input cap below.

Structs§

BoundedGraphAnalysisSummary
CommunitySpan
GraphAnalysisResult: Result of graph analysis
GraphEdge
GraphNode
Motif: Graph motif representation
MotifRecord
QualiaGraph: Graph structure built from NQuin relations
SubgraphMatch: One subgraph-isomorphism match: the data-graph node ids assigned to pattern nodes 0..len. missing_edges is 0 for an exact (induced-monomorphism) match and counts unsatisfied pattern edges for an approximate match.
SubgraphPattern: A directed query pattern for subgraph isomorphism. adjacency[i][j] != 0 requires a data-graph edge from the node mapped to pattern node i to the node mapped to pattern node j. Only the first node_count rows/cols are read.
TopNodeScore

MAX_BOUNDED_GRAPH_ANALYSIS_NODES: Preferred zero-heap node cap for edge-safe topology analysis.
MAX_HEAP_GRAPH_ANALYSIS_QUINS: Heap-backed graph analysis is quarantined behind a fixed input cap so daemon callers do not accidentally fan out into unbounded topology jobs on edge nodes.
MAX_SUBGRAPH_PATTERN_NODES: Maximum number of nodes in a subgraph-isomorphism query pattern. Bounding the pattern keeps the backtracking search depth (and therefore the stack) fixed.

analyze_graph_topology: Analyze graph topology in a bounded, heap-backed batch.
analyze_graph_topology_bounded: Zero-heap topology analysis aligned with the 10D tensor hot-path constraints.
find_subgraph_isomorphisms_bounded: Zero-heap exact/approximate subgraph isomorphism over an NQuin relation set.
pagerank_bounded: Zero-heap PageRank over an NQuin relation set (bounded path).