Struct DtNodeQueue 

pub struct DtNodeQueue { /* private fields */ }

Index-based priority queue for nodes during pathfinding.

Stores indices into a DtNodePool rather than raw pointers. The pool must be passed to operations that need to read node data.

Implementations

impl DtNodeQueue

pub fn new(capacity: usize) -> Self

Creates a new node queue

pub fn clear(&mut self)

pub fn top(&self) -> Option<usize>

Returns the minimum-cost node index, or None if empty.

pub fn pop(&mut self, pool: &DtNodePool) -> Option<usize>

pub fn push(&mut self, node_idx: usize, pool: &DtNodePool)

pub fn modify(&mut self, node_idx: usize, pool: &DtNodePool)

Re-sorts a node after its cost has changed.

pub fn empty(&self) -> bool

pub fn get_mem_used(&self) -> usize

pub fn get_capacity(&self) -> usize