l-grafi.c

Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and

/*----------------------------------------------------------------------
 * L-grafi.c versio 0.1
 * by lupsyn www.mojodo.it
 * Thx to Shane Saunders
 * Greets : My family, Tiarè (i love u) ,my teacher of s.o.
 *---------------------------------------------------------------------*/

#include "in.h"
#include "func.h"

int main(int argc,char * argv[])
{
int n;
double prob=0.01;
dgraph_t *g;
for (n=1;n<500;n++){
for(prob=0.0001;prob<1;prob=prob+0.0003){
g=dgraph_rnd_dense(n,prob);
printf ("Floyd Wharshall %f Tarjan : %f Nodes: %d Probability of density %f\n ",FloydWarshall(g),cfc(g),n,prob);
dgraph_free(g);
}
}
}