Notes

#include <stdio.h>
#define nV 4
#define INF 999

void floydWarshall(int graph[][nV]) {
int matrix[nV][nV], i, j, k;

for (i = 0; i < nV; i++)
for (j = 0; j < nV; j++)
matrix[i][j] = graph[i][j];

for (k = 0; k < nV; k++) {
for (i = 0; i < nV; i++) {
for (j = 0; j < nV; j++) {
if (matrix[i][k] + matrix[k][j] < matrix[i][j])
matrix[i][j] = matrix[i][k] + matrix[k][j];
}
}
}
printf("nnThe results of the Floyd-Warshal Algorithmnn");
printMatrix(matrix);
}

void printMatrix(int matrix[][nV]) {
for (int i = 0; i < nV; i++) {
for (int j = 0; j < nV; j++) {
if (matrix[i][j] == INF)
printf("%4s", "INF");
else
printf("%4d", matrix[i][j]);
}
printf("n");
}
}

int main()
{
int n,i,j,k;
printf("Enter the total number of nodes: ");
scanf("%d", &n);
printf("Enter the adjacency matrix value one by onen");
int graph[n][n];
for(i=0;i<n;i++){
for(j=0;j<n;j++){
printf("G[%d][%d]: ",i+1,j+1);
scanf("%d", &graph[i][j]);
}
}
floydWarshall(graph);
}