Function petgraph::algo::dijkstra

pub fn dijkstra<'a, G: Visitable, K, F, Edges>(graph: &'a G, start: G, goal: Option<G>, edges: F) -> HashMap<G, K> where G: Clone + Eq + Hash, K: Default + Add<Output=K> + Copy + PartialOrd, F: FnMut(&'a G, G) -> Edges, Edges: Iterator<Item=(G, K)>, G::Map: VisitMap<G>

Dijkstra's shortest path algorithm.