It In Adjency List Form, Print The Edges Of The Graph
*/
# include <stdio.h>
# include <stdlib.h>
#include <termios.h>
struct vertex
{
int ver;
struct vertex *adj;
}*head[10],*t1,*t2;
int main()
{
int n,i,j,a[10][10];
char ch;
printf("Enter The Number Of Vertices : ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
printf("\nIs %d Is A Adjacent To %d : ",i,j);
ch=getchar();
if(ch=='y' || ch =='Y')
a[i][j]=1;
else
a[i][j]=0;
}
}
/*---------------------------Printing The Adjacency Matrix --------*/
printf("\nThe Adjacency Matrix Is : \n");
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
printf("%4d",a[i][j]);
printf("\n");
}
for(i=1;i<=n;i++)
{
head[i]=(struct vertex *)malloc(sizeof(struct vertex));
head[i]->ver=i;
head[i]->adj=NULL;
t1=head[i];
for(j=1;j<=n;j++)
{
if(a[i][j]==1)
{
t2=(struct vertex *)malloc(sizeof(struct vertex));
t2->ver=j;
t2->adj=NULL;
if(head[i]->adj==NULL)
{
head[i]->adj=t2;
t1=t1->adj;
}
else
t1->adj=t2;
t1= t2;
}
}
}
printf("\nThe Adjancey List Is : \n");
for(i=1;i<=n;i++)
{
printf("%d : ",head[i]->ver);
for(t1=head[i]->adj;t1!=NULL;t1=t1->adj)
printf(" %d ==> ",t1->ver);
printf(" NULL \n");
}
printf("\n************************************************************************");
printf("\n Printing The Edges");
printf("\n************************************************************************\n");
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(a[i][j]==1)
printf(" < %d, %d > ",i,j);
}
}
printf("\n************************************************************************");
return(1);
}
0 Comments