-
Notifications
You must be signed in to change notification settings - Fork 0
/
depth-first-search.c
133 lines (111 loc) · 2.14 KB
/
depth-first-search.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
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define MAX 5
struct Vertix
{
char label;
bool visited;
};
struct Vertix *vertixes[MAX];
int adjVertix[MAX][MAX];
int count = 0;
int top = 0;
int stack[MAX];
int isFull()
{
return count == MAX;
}
void addVertix(char label){
if(!isFull())
{
struct Vertix* vertix = (struct Vertix*) malloc(sizeof(struct Vertix));
vertix->label = label;
vertix->visited = false;
vertixes[count++] = vertix;
}
else
{
printf("VERTICES ARRAY IS FULL, Cannot add more! \n");
}
}
void addEdge(int vertix1, int vertix2){
adjVertix[vertix1][vertix2] = 1;
}
void push(int vertixNo)
{
stack[top++] = vertixNo;
}
int peek()
{
return stack[top];
}
int pop(){
return stack[top--];
}
int getUnvisitedVertix(int vertexIndex)
{
for(int j=0; j < MAX; j++)
{
if(vertixes[j]->visited == false && adjVertix[vertexIndex][j] == 1)
{
return j;
}
}
return -1;
}
int isStackEmpty()
{
return top == 0;
}
void display(int visitedVertex)
{
printf("VISITED VERTIX: %c \n", vertixes[visitedVertex]->label);
}
void dfs()
{
if(count != 0)
{
int i = 0;
vertixes[0]->visited = true;
display(0);
push(0);
while(top != 0)
{
int unvisitedVertix = getUnvisitedVertix(peek());
if(unvisitedVertix == -1)
{
pop();
}
else
{
vertixes[unvisitedVertix]->visited = true;
display(unvisitedVertix);
push(unvisitedVertix);
}
}
}
}
int main()
{
for(int i = 0; i < MAX; i++)
{
for(int j = 0; j < MAX; j++)
{
adjVertix[i][j] = 0;
}
}
addVertix('S');
addVertix('A');
addVertix('B');
addVertix('C');
addVertix('D');
addEdge(0, 1); // S - A
addEdge(0, 2); // S - B
addEdge(0, 3); // S - C
addEdge(1, 4); // A - D
addEdge(2, 4); // B - D
addEdge(3, 4); // C - D
dfs();
return 0;
}