14 April 2014

Algoritmul Bellman - Ford Program C language

void bellman_ford(int a[50][50])
{
int z,s,v,k,u,d[50],q[50];
printf("\n\nStart: ");
scanf("%d",&s);
printf("n= %d",n);
for(i=1;i<=n;i++)
{
q[i]=99;
if(i==s)
q[i]=0;
}
printf("\nVectorul Q:\n");
for(i=1;i<=n;i++)
printf(" %d ",q[i]);
for(i=1;i<=n;i++)
for(u=1;u<=n;u++)
for(v=1;v<=n;v++)
if(q[v]>q[u]+a[u][v])
q[v]=q[u]+a[u][v];
printf("\nVectorul Q:\n");
for(i=1;i<=n;i++)
printf(" %d ",q[i]);
}


main + citire fisier:

CCSuite - CC Monitoring, CC Reports and AliveCheck

CC Monitoring, CC Reports and AliveCheck Create together a powerful application, user friendly, that helps managing, monitoring ...