(original) (raw)

w y x z w y x z q 4 3 5 –3 6 –7 2 w y x z 1 0 1 1 0 0 1 h(z) = 0 h(y) = –4 h(x) = –7 h(w) = –1 原始圖表有負邊original graphwith negative edges 由貝爾曼 - 福特搵到嘅最短路徑樹shortest path treefound by Bellman-Ford 冇負邊嘅重新加權圖表reweighted graph withno negative edges