[−][src]Function rs_graph::search::biastar::start_directed
pub fn start_directed<'a, G, D, W, H>(
g: &'a G,
src: G::Node,
snk: G::Node,
weights: W,
heur: H
) -> BiAStarDefault<'a, OutEdges<'a, G>, InEdges<'a, G>, D, W, H> where
G: Digraph<'a>,
G::Node: Hash,
D: Copy + PartialOrd + Zero,
W: Fn(G::Edge) -> D,
H: Heuristic<G::Node>,
H::Result: Add<D, Output = D> + Add<H::Result, Output = H::Result> + Neg<Output = H::Result>,
Start a bidirectional A*-search on a directed graph.
This is a convenience wrapper to start the search on an directed graph with the default data structures.
Parameters
g
: the directed 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