[−][src]Function rs_graph::search::astar::start_undirected

pub fn start_undirected<'a, G, D, W, H>(
    g: &'a G, 
    src: G::Node, 
    weights: W, 
    heur: H
) -> AStarDefault<'a, Neighbors<'a, G>, D, W, H> where
    G: Graph<'a>,
    G::Node: Hash,
    D: Copy + PartialOrd + Zero,
    W: Fn(G::Edge) -> D,
    H: AStarHeuristic<G::Node>,
    H::Result: Add<D, Output = D>, 

Start an A*-search on a 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.

Parameter

  • g: the graph
  • weights: the (non-negative) edge weights
  • src: the source node
  • heur: the lower bound heuristic