pub struct MinCutBoundary<V: SensorVocabulary<N>, const N: usize> { /* private fields */ }Expand description
Comfort-zone boundary via global minimum cut on the trust-weighted context graph.
Patent Claims 9–12.
Implementations§
Source§impl<V: SensorVocabulary<N>, const N: usize> MinCutBoundary<V, N>
impl<V: SensorVocabulary<N>, const N: usize> MinCutBoundary<V, N>
Sourcepub fn report_context_with_key(
&mut self,
key: &ContextKey<V, N>,
all_keys: &[(ContextKey<V, N>, u32)],
)
pub fn report_context_with_key( &mut self, key: &ContextKey<V, N>, all_keys: &[(ContextKey<V, N>, u32)], )
Register a context key as a node, providing all existing keys for edge insertion.
If the context is already known, this is O(1). If new, inserts edges to all existing nodes with cosine similarity > EDGE_THRESHOLD (I-BNDRY-003).
Sourcepub fn update_trust(
&mut self,
key: &ContextKey<V, N>,
coherence: f32,
observations: u32,
)
pub fn update_trust( &mut self, key: &ContextKey<V, N>, coherence: f32, observations: u32, )
Update trust-weighted edges for a context after a coherence change.
Recomputes Graph B weights for all edges incident to this context. If either endpoint has fewer than MIN_TRUST_OBSERVATIONS, keeps Graph A weight.
Sourcepub fn min_cut_value(&self) -> f32
pub fn min_cut_value(&self) -> f32
Current minimum cut value of the trust manifold.
Returns 0.0 if fewer than 2 nodes are registered. Patent Claim 9: boundary is computed, not configured.
Sourcepub fn partition(&self) -> MinCutResult
pub fn partition(&self) -> MinCutResult
Full minimum cut result: value and partition.
Patent Claim 10: partition is observable.
Sourcepub fn node_count(&self) -> usize
pub fn node_count(&self) -> usize
Number of registered context nodes.