-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph.c
157 lines (154 loc) · 3.01 KB
/
graph.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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
#include<stdio.h>
#include<stdlib.h>
struct edge
{
char data;
struct edge *next;
};
struct node
{
struct node*next;
char data;
struct edge *enext;
};
void insertvertex(struct node**,char);
void insertedge(struct node*,char,char);
struct node* findvertex(struct node*,char);
void display(struct node*);
void remove_vertex(struct node**,char);
void remove_edge(struct node*,char,char);
int main()
{
struct node *start=NULL;
char src,dest,vert;
int choice;
do
{
printf("\nSelect an option:");
printf("\n1. Add vertex:");
printf("\n2. Insert edge:");
printf("\n3. Display:");
printf("\n4. Quit:");
printf("\nEnter choice:");
scanf("%d",&choice);
} while (1);
switch(choice)
{
case 1:
printf("Enter vertex : ");
fflush(stdin);
scanf("%c",&vert);
insertvertex(&start,vert);
break;
case 2:
printf("Enter source & target Vertex:");
fflush(stdin);
scanf("%c %c",&src,&dest);
insertedge(start,src,dest);
break;
case 3:
display(start);
break;
case 4:
exit(0);
default:
printf("Wrong choice! Try again");
}
return 0;
}
void insertvertex(struct node **ps,char ch)
{
struct node *p,*temp;
p=(struct node *)malloc(sizeof(struct node));
p->data=ch;
p->next=NULL;
p->enext=NULL;
if(*ps==NULL)
{
*ps=p;
printf("Node created");
return;
}
temp=*ps;
while(temp->next!=NULL)
{
temp=temp->next;
}
temp->next=p;
printf("Node created");
return;
}
struct node* findvertex(struct node *p,char ch)
{
while(p!=NULL)
{
if(p->data==ch)
break;
p=p->next;
}
return p;
}
void insertedge(struct node *p,char src,char dest)
{
struct node *temp;
struct edge *e,*t;
if(p==NULL)
{
printf("Cannot insert edge in an empty graph");
return;
}
temp=findvertex(p,src);
if(temp==NULL)
{
printf("%c is not present in the graph",src);
return;
}
if(findvertex(p,dest))
{
printf("%c is not present in the graph",dest);
return;
}
e=(struct edge*)malloc(sizeof(struct edge));
e->data=dest;
e->next=NULL;
if(temp->enext==NULL)
{
temp->enext=e;
return;
}
t=temp->enext;
while(t->next!=NULL)
{
t=t->next;
}
t->next=e;
}
void display(struct node* p)
{
struct edge *e;
if(p==NULL)
{
printf("Graph is empty");
return;
}
while(p!=NULL)
{
printf("\n%c ",p->data);
printf("-->");
e=p->enext;
while(e!=NULL)
{
printf("\t%c",e->data);
e=e->next;
}
p=p->next;
}
}
void remove_vertex(struct node **ps,char ch)
{
if(*ps==NULL)
{
printf("Graph is empty");
return;
}
}