Program to implement Floyd Warshall Algorithms

                                       In This post we have write a c program to implement  Floyd Warshall Algorithm for subject of Analysis of Algorithms | Computer Engineering | Mumbai University (MU) | (Semester 4) 

Program:

#include<stdio.h> 

void floyd(int a[4][4], int n) 

{ 

for(int k=0;k<n;k++) 

{ 

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

{ 

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

{ 

if(a[i][j]>a[i][k]+a[k][j]) 

{ 

a[i][j]=a[i][k]+a[k][j]; 

} 

} 

} 

}

printf("All Pairs Shortest Path is :\n"); 

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

{ 

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

{ 

printf("%d ",a[i][j]); 

} 

printf("\n"); 

} 

} 

int main() 

{ 

int cost[4][4] = {{0, 3, 999, 4}, {8, 0, 2, 999}, {5, 999, 0, 1}, {2,999, 999, 0}}; 

int n = 4; 

floyd(cost,n); 

} 

Output: