Thursday, 24 April 2014

C program to check the presence of self loop in a given Graph

In a graph when a particular edge having both start and end vertices in it known as self loop. 
This program will detect the self loop in a given graph. 



self loop msc computer science

 #include<stdio.h>  
 #include<conio.h>  
 void main()  
 {  
  int i,j;  
  int count2;  
  int m,n,a[10][10];  
   clrscr();  
 printf("\n @@@ Enter the no of edge and vertice @@@ \n-> ");  
  scanf ("%d%d",&m,&n);  
  printf ("\n Enter the adjacency matrix : \n");  
  for (i=0;i<m;i++)  
  {  
   for(j=0;j<n;j++)  
       {  
        scanf("%d",&a[i][j]);  
       }  
  }  
 total=0;  
  for (i=0;i<m;i++)  
  {  
   count=0;  
   for(j=0;j<m;j++)  
       {  
         if ( a[i][j]==1 && i!=j)  
          {  
               count=count+1;  
          }  
               else  
                    if(i==j && a[i][j]==1)  
                {  
                    count=count+2;  
                    printf ("\n>>>vertex %d contain self loop in a graph",i+1);  
                }  
       }  
  }  
 getch();  
  }  

No comments:
Write comments

Featured post

List of Universities in Karnataka offering M.Sc Computer Science

The post-graduate programme in Computer Science (M.Sc Computer Science) contains two academic years duration and having a four semesters....

Popular Posts

Copyright @ 2011-2016