Function bellman_ford

pub fn bellman_ford<D: Direction, E: EdgeTrait>(
    g: &Graph<D, E>,
    src: usize,
) -> Vec<NumInf<E::Weight>>
where
    E::Weight: Copy + Ord + Zero + Add<Output = E::Weight>,

負閉路を持つグラフの最短経路