Bellman–Ford algorithm: Difference between revisions

Revision as of 19:03, 11 November 2004

Revision as of 01:50, 17 November 2004

Line 77:

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

{

printf("Error occuredoccurred. Negative edge weight cycles detected");

break;

}

Line 99:

INFINITY dd 1

format_string1 db "Error occuredoccurred. Negative edge weight cycles detected", 0

format_string2 db "The shortest distance between nodes %i and %i is %i", 0

extern _printf