-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathadjcopy.c
111 lines (93 loc) · 2.03 KB
/
adjcopy.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
#include<stdio.h>
#include<stdlib.h>
struct node
{
int item;
struct node * neigh;
};
/*void printadj(struct node A[],int n)
{
struct node cptr;
for(int i=0;i<n;i++)
{
cptr=A[i];
printf("%d ",cptr.item);
while(cptr.neigh!=NULL)
{
printf("%d ",cptr.item);
cptr=*cptr.neigh;
}
printf("\n");
}
}*/
void adjcreate(struct node * V[],int i,int j)
{
struct node* adj=(struct node*)malloc(sizeof(struct node));
struct node* curr = (struct node*)malloc(sizeof(struct node));
adj->item=j;
adj->neigh=NULL;
curr=V[i];
if(curr->neigh==NULL)
{
V[i]->neigh=adj;
}
//printf("%d\n",curr);
else
{
while(curr->neigh!=NULL)
{
curr = curr->neigh;
//printf("*");
}
}
curr->neigh= adj;
}
int main()
{
int n,m;
scanf("%d",&n);
scanf("%d", &m);
struct node* V[n];
V[n]=(struct node*)malloc(n*sizeof(struct node));
struct node *adj2, *adj;
for(int i=0;i<n;i++)
{
V[i]->item=i;
V[i]->neigh=NULL;
}
int i,j;
for(int c=0;c<m;c++)
{
scanf("%d %d", &i,&j);
adjcreate(V,i,j);
adjcreate(V,j,i);
/*adj2=(struct node*)malloc(sizeof(struct node));
adj2->item=i;
struct node* curr2 = V[j].neigh;
while(curr2!=NULL)
{
curr2 = curr2->neigh;
printf("*");
}
curr2 = adj2;
*/
}
struct node *cptr;
for(int i=0;i<n;i++)
{
cptr=V[i]->neigh;
//printf("%d ",cptr->item);
if(cptr==NULL)
{
printf("Nil\n");
continue;
}
while(cptr!=NULL)
{
printf("%d ",cptr->item);
cptr=cptr->neigh;
}
printf("\n");
}
//printadj(V,n);
}