void rfloyd(int a[50][50])
{ int k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j && i!=k && j!=k)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
print(a);
}
CCSuite - CC Monitoring, CC Reports and AliveCheck
CC Monitoring, CC Reports and AliveCheck Create together a powerful application, user friendly, that helps managing, monitoring ...
-
CC Monitoring, CC Reports and AliveCheck Create together a powerful application, user friendly, that helps managing, monitoring ...
-
#include<stdio.h> #include<conio.h> #include<stdlib.h> int i,j,k,a,b,u,v,n,ne=1; int min,mincost=0,cost[9][9],...
-
#include "string.h" #include "iostream.h" #include "stdio.h" #include "conio.h" #include "ctype...