[−][src]Function rs_graph::shortestpath::dijkstra::start_directed
pub fn start_directed<'a, G, D, W>(
g: &'a G,
src: G::Node,
weights: W
) -> DijkstraDefault<'a, OutEdges<'a, G>, D, W> where
G: Digraph<'a>,
G::Node: Hash,
D: Copy + PartialOrd + Zero,
W: Fn(G::Edge) -> 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 graphweights
: the (non-negative) edge weightssrc
: the source node