Struct QueueNode 

pub struct QueueNode<Idx, T>
where
    Idx: RawIndex,
{ /* private fields */ }

A node in the priority queue for Dijkstra’s algorithm

Implementations

impl<Idx, T> QueueNode<Idx, T>

where Idx: RawIndex,

pub const fn new(cost: T, vertex: VertexId<Idx>) -> Self

Creates a new QueueNode with the given cost and vertex.

pub fn from_cost(cost: T) -> Self

where Idx: Default,

create a new node with the given cost and a default vertex

pub fn from_vertex(vertex: VertexId<Idx>) -> Self

where T: Default,

create a new node with the given vertex and a default cost

pub const fn cost(&self) -> &T

returns an immutable reference to the cost of the node

pub const fn cost_mut(&mut self) -> &mut T

returns a mutable reference to the cost of the node

pub const fn vertex(&self) -> &VertexId<Idx>

returns an immutable reference to the vertex of the node

pub const fn vertex_mut(&mut self) -> &mut VertexId<Idx>

returns a mutable reference to the vertex of the node

pub fn set_cost(&mut self, cost: T) -> &mut Self

update the current cost and return a mutable reference to the node

pub fn set_vertex(&mut self, vertex: VertexId<Idx>) -> &mut Self

update the current vertex and return a mutable reference to the node

pub fn with_cost(self, cost: T) -> Self

consumes the current instance to create another with the given cost

pub fn with_vertex(self, vertex: VertexId<Idx>) -> Self

consumes the current instance to create another with the given vertex

Trait Implementations

impl<Idx, T: Clone> Clone for QueueNode<Idx, T>

where Idx: RawIndex + Clone,

fn clone(&self) -> QueueNode<Idx, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Idx, T: Debug> Debug for QueueNode<Idx, T>

where Idx: RawIndex + Debug,

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

Formats the value using the given formatter.

impl<Idx, T: Default> Default for QueueNode<Idx, T>

where Idx: RawIndex + Default,

fn default() -> QueueNode<Idx, T>

Returns the “default value” for a type.

impl<Idx, T> Hash for QueueNode<Idx, T>

where Idx: RawIndex + Eq + Hash, T: Eq + Hash,

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<Idx, T> Ord for QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialOrd + PartialEq,

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'a, Idx, T> PartialEq<&'a QueueNode<Idx, T>> for QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialEq,

fn eq(&self, other: &&'a QueueNode<Idx, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a, Idx, T> PartialEq<&'a mut QueueNode<Idx, T>> for QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialEq,

fn eq(&self, other: &&'a mut QueueNode<Idx, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Idx, T> PartialEq<QueueNode<Idx, T>> for &QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialEq,

fn eq(&self, other: &QueueNode<Idx, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Idx, T> PartialEq<QueueNode<Idx, T>> for &mut QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialEq,

fn eq(&self, other: &QueueNode<Idx, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Idx, T> PartialEq for QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialEq,

fn eq(&self, other: &QueueNode<Idx, T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a, Idx, T> PartialOrd<&'a QueueNode<Idx, T>> for QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialEq + PartialOrd,

fn partial_cmp(&self, other: &&'a QueueNode<Idx, T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'a, Idx, T> PartialOrd<&'a mut QueueNode<Idx, T>> for QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialEq + PartialOrd,

fn partial_cmp(&self, other: &&'a mut QueueNode<Idx, T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<Idx, T> PartialOrd<QueueNode<Idx, T>> for &QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialEq + PartialOrd,

fn partial_cmp(&self, other: &QueueNode<Idx, T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<Idx, T> PartialOrd<QueueNode<Idx, T>> for &mut QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialEq + PartialOrd,

fn partial_cmp(&self, other: &QueueNode<Idx, T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<Idx, T> PartialOrd for QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialEq + PartialOrd,

fn partial_cmp(&self, other: &QueueNode<Idx, T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<Idx, T: Copy> Copy for QueueNode<Idx, T>

where Idx: RawIndex + Copy,

impl<Idx, T> Eq for QueueNode<Idx, T>

where Idx: RawIndex + PartialEq, T: PartialEq,