warshalls - /*DWIVEDIRAHUL ROLLNO:18SECMPN(A)...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
/*DWIVEDI RAHUL ROLL NO:-18 SE-CMPN(A) PROGRAM FOR WARSHALL’S ALGORITHIM*/ #include<stdio.h> #include<conio.h> #define max 20 #define true 1 #define false 0 int path[max][max];   void warshall(int n) {  int i,j,k;   for(k=0;k<=n-1;k++)     for(i=0;i<=n-1;i++)      for(j=0;j<=n-1;j++) [j]!=0)))         {  path[i][j]=1;  }          else  path[i][j]=0; } void main() { int a[max][max];   int n,i,j,connected;   clrscr();   printf("Enter no. of nodes ");   scanf("%d",&n);          for(i=0;i<=n-1;i++)              for(j=0;j<=n-1;j++)       {            scanf("%d",&a[i][j]);            path[i][j]=a[i][j];      }  printf("Adjaceny matrix entered is \n");      for(i=0;i<=n-1;i++)   {   printf("\n");      for(j=0;j<=n-1;j++)           printf("%d ",path[i][j]);   }  warshall(n);  connected=true;   for(i=0;i<=n-1;i++)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/25/2010 for the course CMPN SEM4 taught by Professor Thakur during the Spring '07 term at University of Mumbai.

Page1 / 2

warshalls - /*DWIVEDIRAHUL ROLLNO:18SECMPN(A)...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online