Tag Archives for Graph
path matrix by Warshall’s algorithm
Program to find path matrix by Warshall's algorithm. #include<stdio.h> #include<conio.h> #define MAX 20 int main() { int i,j,k,n; int w_adj[MAX][MAX],adj[MAX][MAX],path[MAX][MAX]; printf("Enter number of vertices : "); scanf("%d",&n); printf("Enter weighted adjacency matrix :\n"); for(i=0;i<n;i++) for(j=0;j<n;j++) scanf("%d",&w_adj[i][j]); printf("The weighted adjacency matrix … Continue reading