Bellman–Ford algorithm: Difference between revisions

Revision as of 14:56, 28 October 2004

Revision as of 14:56, 28 October 2004

Line 49:

}Edge;

void BellmanFord(Edge edges[], size_t edgecount, size_t nodecount, size_t source) // nodecount = number of vertices

{

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

Line 80:

}

}

== Applications in routing ==