Trait h3ron_graph::algorithm::shortest_path::ShortestPath

pub trait ShortestPath<W> {
    fn shortest_path<I, OPT: ShortestPathOptions>(
        &self,
        origin_cell: H3Cell,
        destination_cells: I,
        options: &OPT
    ) -> Result<Vec<Path<W>>, Error>
    where
        I: IntoIterator,
        I::Item: Borrow<H3Cell>;
}

Implements a simple Dijkstra shortest path route finding.

While this is not the most efficient routing algorithm, it has the benefit of finding the nearest destinations first. So it can be used to answer questions like “which are the N nearest destinations” using a large amount of possible destinations.

Required Methods

fn shortest_path<I, OPT: ShortestPathOptions>(
    &self,
    origin_cell: H3Cell,
    destination_cells: I,
    options: &OPT
) -> Result<Vec<Path<W>>, Error>where
    I: IntoIterator,
    I::Item: Borrow<H3Cell>,

Implementors

impl<W, G> ShortestPath<W> for Gwhere
    G: GetCellEdges<EdgeWeightType = W> + GetCellNode + HasH3Resolution + NearestGraphNodes,
    W: PartialOrd + PartialEq + Add + Copy + Ord + Zero,