-
Notifications
You must be signed in to change notification settings - Fork 25
/
adjecency_matrix.c
58 lines (47 loc) · 1.07 KB
/
adjecency_matrix.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
//Implementing Warshall's Algorithm for Calculating Path Matrix
#include<stdio.h>
void warshall(int [][4],int [][4]);
int main(){
int adj[4][4],path[4][4];
int i,j;
int n=4;
for ( i = 0; i < n; i++)
{
for ( j = 0; j < n; j++)
{
printf("Is there a path from V[%d] to v[%d] (Yes-1/No-0) ? ",i+1,j+1);
scanf("%d",&adj[i][j]);
}
}
warshall(adj,path);
printf("Following are the path matrix \n");
for ( i = 0; i < n; i++)
{
for ( j = 0; j < n; j++)
{
printf("%d \t",path[i][j]);
}
printf("\n");
}
return 0;
}
void warshall(int adj[][4],int path[][4]){
int i,j,k,n=4;
for ( i = 0; i < n; i++)
{
for ( j = 0; j < n; j++)
{
path[i][j] = adj[i][j];
}
}
for ( k = 0; k < n; k++)
{
for ( i = 0; i < n; i++)
{
for ( j= 0; j < n; j++)
{
path[i][j] = path[i][j] || (path[i][k] && path[k][j]);
}
}
}
}