Function bellman_ford 

pub fn bellman_ford(
    graph: &HashMap<String, Vec<Edge>>,
    start: &str,
) -> Result<(HashMap<String, f64>, HashMap<String, String>), Error>

Bellman-Ford shortest paths with negative cycle detection.