Shortest Path Algorithm ‘Warshall’s Method

Code Id 37
Date Updated 3/7/2010
Title Shortest path algorithm � Warshall�s method  
Description 
This program implements shortest path algorithm using Warshall�s method.
Codes Snippet 
#include
#define MAX 20
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

Comments are closed.