pub struct HeapEngine;Expand description
Max-heap priority queue propagation. Processes strongest signal first. Early-terminates when heap top drops below threshold. Uses BloomFilter for fast visited checks.
Implementations§
Source§impl HeapEngine
impl HeapEngine
Trait Implementations§
Source§impl ActivationEngine for HeapEngine
impl ActivationEngine for HeapEngine
Source§fn propagate(
&self,
graph: &Graph,
seeds: &[(NodeId, FiniteF32)],
config: &PropagationConfig,
) -> M1ndResult<DimensionResult>
fn propagate( &self, graph: &Graph, seeds: &[(NodeId, FiniteF32)], config: &PropagationConfig, ) -> M1ndResult<DimensionResult>
Propagate from seeds through the graph. Returns sparse activation map.
Replaces: engine_v2.py D1_Structural.activate()
Auto Trait Implementations§
impl Freeze for HeapEngine
impl RefUnwindSafe for HeapEngine
impl Send for HeapEngine
impl Sync for HeapEngine
impl Unpin for HeapEngine
impl UnsafeUnpin for HeapEngine
impl UnwindSafe for HeapEngine
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more