Struct VisitedSet 

pub struct VisitedSet { /* private fields */ }

Generation-based visited-node tracker for greedy search.

Avoids clearing a Vec<bool> on every query by incrementing a generation counter.

Implementations

impl VisitedSet

pub fn new(capacity: usize) -> Self

Create a new VisitedSet with pre-allocated capacity for capacity nodes.

pub fn clear(&mut self)

Reset the visited state for all nodes in O(1) by advancing the generation.

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

Grow the internal buffer if node would be out of range.

Resizing uses node + 1; the maximum ID must permit that addition and allocation.

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

Mark node as visited if it has not been visited in this generation.

Returns true on first visit, false on subsequent calls for the same node. Resizing uses node + 1, with the same capacity requirements as ensure_capacity.

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

Mark a node as visited; returns true on its first visit in this generation.

pub fn visit_all(&mut self, nodes: impl Iterator<Item = usize>)

Mark multiple nodes as visited.

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

Return true if node has been marked in the current generation.

Trait Implementations

impl Clone for VisitedSet

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for VisitedSet

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

Formats the value using the given formatter.