Function rs_graph::shortestpath::dijkstra::start_directed

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

Start a Dijkstra-search on a directed graph.

This is a convenience wrapper to start the search on an directed graph with the default data structures.

Parameter

• g: the graph
• weights: the (non-negative) edge weights
• src: the source node