Function dijkstra::costs

pub fn costs<V, Es, Vs, Ws, WsI, W>(
    start: V, 
    neighbors: Es, 
    costs: Ws, 
    cost: WsI
) -> Ws where
    V: Copy + Ord,
    Es: FnMut(V) -> Vs,
    Vs: IntoIterator<Item = (V, W)>,
    WsI: FnMut(&mut Ws, V) -> &mut W,
    W: Copy + Ord + Add<Output = W> + Sum, 

Computes costs for each node.