Struct GreedyBisectionPhiEngine 

pub struct GreedyBisectionPhiEngine { /* private fields */ }

Greedy bisection Φ approximation.

Starts from the Fiedler-based spectral partition and greedily swaps elements between sets A and B to minimize information loss. Each swap is accepted only if it reduces Φ. Converges to a local minimum.

Complexity: O(n³) — at most n passes of n element swaps.

Implementations

impl GreedyBisectionPhiEngine

pub fn new(max_passes: usize) -> Self

Trait Implementations

impl Default for GreedyBisectionPhiEngine

fn default() -> Self

Returns the “default value” for a type.

impl PhiEngine for GreedyBisectionPhiEngine

fn compute_phi( &self, tpm: &TransitionMatrix, state: Option<usize>, budget: &ComputeBudget, ) -> Result<PhiResult, ConsciousnessError>

Compute Φ for the given transition probability matrix.

fn algorithm(&self) -> PhiAlgorithm

Return the algorithm identifier.

fn estimate_cost(&self, n: usize) -> u64

Estimate computational cost without performing the computation.