Bellman–Ford algorithm: Difference between revisions

Content deleted Content added
wikicode; finish proof
vertex.predecessor doesn't make any sense -- v.predecessor, right?
Line 26:
'''if''' v '''is''' source '''then''' v.distance = 0
'''else''' v.distance = '''infinity'''
vertexv.predecessor = '''null'''
''// Step 2: relax edges repeatedly