Module h3ron_graph::algorithm::differential_shortest_path
source · Structs
Traits
“Differential” routing calculates the shortest path from (multiple) origin cells
to the
N nearest destinations.
This done once to the un-modified graph, and once the the graph with a set of nodes
being removed, the exclude_cells parameter.