Bellman–Ford algorithm: Difference between revisions

Revision as of 19:21, 11 May 2005

Revision as of 19:22, 11 May 2005

Line 94:

}

}

for(int i = 0; i < edgecount; i++)

{

if(distance[edges[i].dest] > distance[edges[i].source] + edges[i].weight)