[−][src]Function rs_graph::search::astar::start
pub fn start<'a, A, D, W, H>(
adj: A,
src: A::Node,
weights: W,
heur: H
) -> AStarDefault<'a, A, D, W, H> where
A: Adjacencies<'a>,
A::Node: Hash,
D: Copy + PartialOrd + Zero,
W: Fn(A::Edge) -> D,
H: AStarHeuristic<A::Node>,
H::Result: Add<D, Output = D>,
Start and return an A*-iterator using default data structures.
This is a convenience wrapper around start_with_data
using the default
data structures returned by default_data
.
Parameter
adj
: adjacency information for the graphsrc
: the source node at which the search should start.weights
: the weight function for each edgeheur
: the heuristic used in the search