[−][src]Function rs_graph::shortestpath::bidijkstra::start_directed

pub fn start_directed<'a, G, D, W>(
    g: &'a G, 
    src: G::Node, 
    snk: G::Node, 
    weights: W
) -> BiDijkstraDefault<'a, OutEdges<'a, G>, InEdges<'a, G>, D, W> where
    G: Digraph<'a>,
    G::Node: Hash,
    D: Copy + PartialOrd + Zero,
    W: Fn(G::Edge) -> D, 

Start a bidirectional Dijkstra-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 graph
  • src: 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 edge
  • heur: the heuristic used in the search