-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathquestion38.c
113 lines (91 loc) · 2.05 KB
/
question38.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
/*
http://www.geeksforgeeks.org/connected-components-in-an-undirected-graph/
*/
#include <stdio.h>
#include <stdlib.h>
#define MAX 100
struct adjListNode{
int data;
struct adjListNode *next;
};
struct adjList{
struct adjListNode *head;
};
struct graph{
int vertices;
struct adjList *arr;
};
struct adjListNode *newNode(int data){
struct adjListNode *temp = (struct adjListNode *)malloc(sizeof(struct adjListNode));
temp->data = data;
temp->next = NULL;
return temp;
}
void createEdge(int start, int end, struct graph *newGraph){
struct adjListNode *temp = newNode(end);
if(newGraph->arr[start].head){
temp->next = newGraph->arr[start].head;
newGraph->arr[start].head = temp;
}else{
newGraph->arr[start].head = temp;
}
temp = newNode(start);
if(newGraph->arr[end].head){
temp->next = newGraph->arr[end].head;
newGraph->arr[end].head = temp;
}else{
newGraph->arr[end].head = temp;
}
}
void display(struct graph *newGraph){
int i;
struct adjListNode *temp;
for(i=0;i<newGraph->vertices;i++){
temp = newGraph->arr[i].head;
printf("%d --> ", i);
while(temp){
printf("%d ", temp->data);
temp = temp->next;
}
printf("\n");
}
}
void dfs(int index, struct graph *newGraph, int *visited){
visited[index] = 1;
printf("%d ", index);
struct adjListNode *temp = newGraph->arr[index].head;
while(temp){
if(visited[temp->data] == 0 ){
dfs(temp->data, newGraph, visited);
}
temp = temp->next;
}
}
void init(int *visited, int vertices){
int i;
for(i=0;i<vertices;i++){
visited[i] = 0;
}
}
int main(){
struct graph *newGraph = (struct graph *)malloc(sizeof(struct graph));
int vertices = 5;
newGraph->vertices = vertices;
newGraph->arr = (struct adjList *)calloc(vertices, sizeof(struct adjList));
createEdge(1,0, newGraph);
createEdge(2,3, newGraph);
createEdge(3,4, newGraph);
int visited[vertices];
init(visited, vertices);
int count = 0;
int i;
for(i=0;i<vertices;i++){
if(visited[i] == 0){
count++;
dfs(i,newGraph,visited);
}
printf("\n");
}
printf("components are %d\n", count);
return 0;
}