Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- BellmanFord(G,w, s, t):
- (1) B(0, t) ← 0
- (2) B(0, v) ← ∞ for each v ∈ V − { t }
- (3) for i ← 1 to |V | − 1
- (4) for each v ∈ V
- (5) B(i, v) ← B(i − 1, v)
- (6) for each (v, u) ∈ E
- (7) if B(i, v) > w(v, u) + B(i − 1, u) then
- (8) B(i, v) ← w(v, u) + B(i − 1, u)
- (9) return B(|V | − 1, s)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement