Struct GraphArena 

pub struct GraphArena {
    pub vars: Vec<ScopedVar>,
    pub var_to_idx: HashMap<ScopedVar, usize>,
    pub edges: Vec<(usize, usize, i32, bool)>,
}

The GraphArena represents the CPU Geometry Layer in the hybrid pipeline. It translates the semantic interactions (from the FormulaArena) into a weighted directed graph using De Bruijn indexing and lexical depths, enabling purely structural verification.

Fields

vars: Vec<ScopedVar>

var_to_idx: HashMap<ScopedVar, usize>

edges: Vec<(usize, usize, i32, bool)>

Implementations

impl GraphArena

pub fn new() -> Self

pub fn add_var(&mut self, var: ScopedVar) -> usize

pub fn from_constraints(constraints: &[Constraint]) -> Self

pub fn collapse_scc_0_weight(&mut self)

pub fn kosaraju_scc(&self) -> Vec<Vec<usize>>

Returns Strongly Connected Components for 0-weight edges using Kosaraju’s algorithm

pub fn contract_graph( &self, sccs: &[Vec<usize>], ) -> (Vec<usize>, Vec<(usize, usize, i32)>, Vec<usize>)

pub fn isolate_sc_bedrock(&mut self) -> Vec<String>

Continuous daemon that isolates Strongly Cantorian (ZFC-compliant) bedrock by scanning for subgraphs satisfying the x = T(x) constraint (topological self-loops) and severing their outgoing +1 offset edges to reduce computational load.

pub fn topological_sort(&self) -> Option<Vec<usize>>

pub fn classify_subsystems(&self, d: &[i32]) -> (bool, bool)

pub fn evaluate_topology( &mut self, ) -> Result<(Vec<i32>, Vec<String>, bool, bool), String>

Evaluates the topological structure using a hybrid approach. It attempts a fast O(V+E) DAG Shortest Path evaluation first. If the graph contains cycles, it falls back to the O(V*E) Bellman-Ford algorithm to detect negative-weight cycles (Extensionality Collisions).

pub fn extract_conflict_clauses(&mut self) -> Vec<Vec<usize>>

Extract Minimal Conflict Clauses for Vector Superposition (IDL Masking) When Bellman-Ford flags a negative-weight cycle, this identifies the nodes involved so the upper ingestion layer can translate them into a hyperdimensional destructive interference mask.

Trait Implementations

impl Clone for GraphArena

fn clone(&self) -> GraphArena

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphArena

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphArena

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for GraphArena

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.