Enum h3ron_graph::algorithm::path::Path [−][src]
Expand description
Path describes a path between a cell and another.
Variants
OriginIsDestination(H3Cell, W)path is empty as origin and destination are the same.
Tuple Fields of OriginIsDestination
0: H3Cell1: Wa sequence of edges describing the path.
The edges in the vec are expected to be consecutive.
The cost is the total cost summed for all of the edges.
Implementations
Trait Implementations
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
order by cost, origin index and destination_index.
This ordering can used to bring Vecs of routes in a deterministic order to make them
comparable
This method returns an ordering between self and other values if one exists. Read more
This method tests less than (for self and other) and is used by the < operator. Read more
This method tests less than or equal to (for self and other) and is used by the <=
operator. Read more
This method tests greater than (for self and other) and is used by the > operator. Read more
Auto Trait Implementations
impl<W> RefUnwindSafe for Path<W> where
W: RefUnwindSafe,
impl<W> UnwindSafe for Path<W> where
W: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Compare self to key and return true if they are equal.