Struct TraversalEngine 

pub struct TraversalEngine {
    pub num_nodes: usize,
    pub root: usize,
    pub graph: RelationshipGraph,
    pub budget: Budget,
    pub visited: Vec<Marker>,
    pub accepted: Accumulator<usize>,
    pub queue: Buffer<usize>,
}

Budgeted traversal assembled from reusable structures and connective owners.

Fields

num_nodes: usize

Number of nodes in the fixed universe.

root: usize

Root node admitted into the initial frontier.

graph: RelationshipGraph

Relationship owner.

budget: Budget

Traversal-cost owner.

visited: Vec<Marker>

Per-node visited markers.

accepted: Accumulator<usize>

Owner of accepted traversal results.

queue: Buffer<usize>

Frontier owner.

Implementations

impl TraversalEngine

pub fn new(num_nodes: usize, root: usize, max_budget: u64) -> TraversalEngine

Load the target graph through RelationshipGraph, then initialize the connective owners.

pub fn budget_remaining(&self) -> u64

Remaining capacity projected from the Budget owner.

pub fn queue_contains(&self, node: usize) -> bool

Whether the frontier currently retains node.

pub fn visited_contains(&self, node: usize) -> bool

Whether node has been visited.

pub fn accepted_contains(&self, node: usize) -> bool

Whether node was accepted into the result.

pub fn can_visit(&self, node: usize) -> bool

Whether visiting node is currently enabled.

pub fn can_skip(&self, node: usize) -> bool

Whether skipping node is currently enabled.

pub fn can_terminate(&self) -> bool

Whether terminal stuttering is enabled.

pub fn visited_count(&self) -> usize

Number of set visited markers, derived without a duplicate counter.

pub fn visit_node(&mut self, node: usize)

Visit one queued node and atomically couple acceptance to Budget allocation.

pub fn skip(&mut self, node: usize)

Remove one queued node without visiting or charging it.

pub fn terminate(&mut self)

Enabled-at-empty traversal termination is an exact stutter.