Struct h3ron_graph::graph::h3edge::H3EdgeGraph

pub struct H3EdgeGraph<W: Send + Sync> {
    pub edges: ThreadPartitionedMap<H3Edge, W>,
    pub h3_resolution: u8,
}

Fields

edges: ThreadPartitionedMap<H3Edge, W>

h3_resolution: u8

Implementations

impl<W> H3EdgeGraph<W> where
    W: PartialOrd + PartialEq + Add + Copy + Send + Sync, 

pub fn new(h3_resolution: u8) -> Self

pub fn num_nodes(&self) -> usize

This has to generate the node list first, so its rather expensive to call.

pub fn num_edges(&self) -> usize

pub fn edge_weight(&self, edge: &H3Edge) -> Option<&W>

pub fn edges_from_cell(&self, cell: &H3Cell) -> Vec<(&H3Edge, &W)>

get all edges in the graph leading from this edge to neighbors

pub fn edges_to_cell(&self, cell: &H3Cell) -> Vec<(&H3Edge, &W)>

get all edges in the graph leading to this cell from its neighbors

pub fn add_edge_using_cells(
    &mut self,
    cell_from: H3Cell,
    cell_to: H3Cell,
    weight: W
) -> Result<(), Error>

pub fn add_edge_using_cells_bidirectional(
    &mut self,
    cell_from: H3Cell,
    cell_to: H3Cell,
    weight: W
) -> Result<(), Error>

pub fn add_edge(&mut self, edge: H3Edge, weight: W) -> Result<(), Error>

pub fn try_add(&mut self, other: H3EdgeGraph<W>) -> Result<(), Error>

pub fn nodes(&self) -> ThreadPartitionedMap<H3Cell, NodeType>

cells which are valid targets to route to

This is a rather expensive operation as nodes are not stored anywhere and need to be extracted from the edges.

Trait Implementations

impl<W: Clone + Send + Sync> Clone for H3EdgeGraph<W>

fn clone(&self) -> H3EdgeGraph<W>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<W> CoveredArea for H3EdgeGraph<W> where
    W: PartialOrd + PartialEq + Add + Copy + Send + Sync, 

fn covered_area(
    &self,
    reduce_resolution_by: u8
) -> Result<MultiPolygon<f64>, Error>

calculates a MultiPolygon of the area covered by a graph

impl<'de, W: Send + Sync> Deserialize<'de> for H3EdgeGraph<W> where
    W: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<W> From<PreparedH3EdgeGraph<W>> for H3EdgeGraph<W> where
    W: PartialOrd + PartialEq + Add + Copy + Send + Ord + Zero + Sync, 

fn from(prepared_graph: PreparedH3EdgeGraph<W>) -> Self

Performs the conversion.

impl<W> GetStats for H3EdgeGraph<W> where
    W: Send + Sync + PartialEq + PartialOrd + Add + Copy, 

fn get_stats(&self) -> GraphStats

impl<W> HasH3Resolution for H3EdgeGraph<W> where
    W: Send + Sync, 

fn h3_resolution(&self) -> u8

Gets the index resolution (0-15)

impl<W: Send + Sync> Serialize for H3EdgeGraph<W> where
    W: Serialize, 

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

Serialize this value into the given Serde serializer.

impl<W> TryFrom<H3EdgeGraph<W>> for PreparedH3EdgeGraph<W> where
    W: PartialOrd + PartialEq + Add + Copy + Send + Ord + Zero + Sync, 

type Error = Error

The type returned in the event of a conversion error.

fn try_from(graph: H3EdgeGraph<W>) -> Result<Self, Self::Error>

Performs the conversion.