Function bellman_ford 

pub fn bellman_ford<G, F>(
    graph: &G,
    source: G::Node,
    edge_cost: F,
) -> Result<Option<BellmanFord<G::Node>>>
where
    G: IndexGraphView,
    F: Fn(G::Edge) -> i64,

Computes signed shortest paths from source.

Errors

Returns an error for arithmetic overflow or a reachable negative cycle.