Struct PriorityNode 

pub struct PriorityNode<P = i64, Idx = usize>
where
    Idx: RawIndex,
{ /* private fields */ }

Priority queue node for A* algorithm

Implementations

impl<P, Idx> PriorityNode<P, Idx>

where Idx: RawIndex,

pub fn new(vertex: VertexId<Idx>, priority: P) -> Self

Create a new priority node with the given vertex and priority

pub const fn priority(&self) -> &P

returns an immutable reference to the priority of the node

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

returns an immutable reference to the vertex of the node

Trait Implementations

impl<P: Clone, Idx> Clone for PriorityNode<P, Idx>

where Idx: RawIndex + Clone,

fn clone(&self) -> PriorityNode<P, Idx>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P: Debug, Idx> Debug for PriorityNode<P, Idx>

where Idx: RawIndex + Debug,

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

Formats the value using the given formatter.

impl<'de, P, Idx> Deserialize<'de> for PriorityNode<P, Idx>

where Idx: RawIndex + Deserialize<'de>, P: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<P: Hash, Idx> Hash for PriorityNode<P, Idx>

where Idx: RawIndex + 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<P, Idx> Ord for PriorityNode<P, Idx>

where P: Ord, Idx: RawIndex + Ord,

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<P, Idx> PartialEq<P> for PriorityNode<P, Idx>

where P: PartialEq, Idx: RawIndex + PartialEq,

fn eq(&self, other: &P) -> 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<P: PartialEq, Idx> PartialEq for PriorityNode<P, Idx>

where Idx: RawIndex + PartialEq,

fn eq(&self, other: &PriorityNode<P, Idx>) -> 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<P, Idx> PartialOrd<P> for PriorityNode<P, Idx>

where P: PartialOrd, Idx: RawIndex + PartialOrd,

fn partial_cmp(&self, other: &P) -> 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<P, Idx> PartialOrd for PriorityNode<P, Idx>

where P: PartialOrd, Idx: RawIndex + PartialOrd,

fn partial_cmp(&self, other: &Self) -> 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<P, Idx> Serialize for PriorityNode<P, Idx>

where Idx: RawIndex + Serialize, P: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<P: Copy, Idx> Copy for PriorityNode<P, Idx>

where Idx: RawIndex + Copy,

impl<P: Eq, Idx> Eq for PriorityNode<P, Idx>

where Idx: RawIndex + Eq,

impl<P, Idx> StructuralPartialEq for PriorityNode<P, Idx>

where Idx: RawIndex,