-
Notifications
You must be signed in to change notification settings - Fork 0
/
DFSwithRecursion.c
59 lines (43 loc) · 1.14 KB
/
DFSwithRecursion.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
#include "adjMatrix.h"
#define unvisited 0
#define visited 1
#define processed 2
#define NIL -1
void dfs(int *adjMat, int v){
int *parent, *status;
int i, source;
parent = (int*)malloc(v*sizeof(int));
status = (int*)malloc(v*sizeof(int));
for(i=0; i<v; i++){
parent[i] = NIL;
status[i] = unvisited;
}
printf("\nEnter starting vertex: ");
scanf("%d", &source);
dfsVisit(adjMat, v, source, parent, status);
printf("\n\nParent Child\n");
for(i=0; i<v; i++){
printf(" %d\t %d\n", parent[i], i);
}
}
void dfsVisit(int *adjMat, int v, int u, int *parent, int *status){
status[u] = visited;
printf("%d, ", u);
int i;
// for(i=0; i<v; i++)
for(i=v-1; i>=0; i--){ // adjMat[u][i] > 0 i.e. vertex i is adjacent to vertex u
if( *(adjMat+(u*v)+i) > 0 && status[i]==unvisited){ // if adjacent vertex color is white then
parent[i] = u;
dfsVisit(adjMat, v, i, parent, status);
}
}
status[u] = processed;
}
int main(){
int *adjMat, v, type;
adjMat = initializeGraph(&v);
type = inputGraph(adjMat, v);
displayGraph(adjMat, v);
dfs(adjMat, v);
return 0;
}