Bellman–Ford algorithm: Difference between revisions

Revision as of 01:15, 10 May 2005

Revision as of 19:21, 11 May 2005

Line 77:

void BellmanFord(Edge edges[], size_t edgecount, size_t nodecount, size_t source)

{

int i,j ;

int* distance = (int*) malloc(nodecount*sizeof(int));

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

{

if(i == source) distance[i] = 0;

else distance[i] = INFINITY;

}

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

{

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

{

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

Line 101 ⟶ 102:

}

}

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

{

printf("The shortest distance between nodes %i and %i is %i", source, i, distance[i]);