Function rs_graph::search::biastar::start_undirected
source · pub fn start_undirected<'a, G, D, W, H>(
g: &'a G,
src: G::Node<'a>,
snk: G::Node<'a>,
weights: W,
heur: H
) -> BiAStarDefault<'a, Neighbors<'a, G>, Neighbors<'a, G>, D, W, H>where
G: Graph,
G::Node<'a>: Hash,
D: Copy + PartialOrd + Zero,
W: Fn(G::Edge<'a>) -> D,
H: Heuristic<G::Node<'a>>,
H::Result: Add<D, Output = D> + Add<H::Result, Output = H::Result> + Neg<Output = H::Result>,
Expand description
Start a bidirectional A*-search on an undirected graph.
Each edge can be traversed in both directions with the same weight.
This is a convenience wrapper to start the search on an undirected graph with the default data structures.
Parameters
g
: the undirected graphsrc
: the source node at which the path should start.snk
: the snk node at which the path should end.weights
: the weight function for each edgeheur
: the heuristic used in the search