Trait NearestGraphNodes

pub trait NearestGraphNodes {
    // Required method
    fn nearest_graph_nodes(
        &self,
        cell: &H3Cell,
        max_distance_k: u32,
    ) -> Result<NearestGraphNodesGetCellIter<'_, Self>, Error>
       where Self: Sized;
}

find the nearest nodes in the graph

Required Methods

fn nearest_graph_nodes( &self, cell: &H3Cell, max_distance_k: u32, ) -> Result<NearestGraphNodesGetCellIter<'_, Self>, Error>

where Self: Sized,

get an iterator over the closest corresponding nodes in the graph to the given cell. The iterator will return all nodes with the same, smallest k <= max_distance_k which are part of the graph.

Implementors

impl<G> NearestGraphNodes for G

where G: GetCellNode,