Function competitive_programming_rs::graph::shortest_path::bellman_ford::shortest_path

pub fn shortest_path(
    graph: &Vec<Vec<(usize, i64)>>, 
    start: usize, 
    inf: i64
) -> (Vec<i64>, Vec<bool>)