그 외 공부/Algorithm
# 11_Graph
ssangeun
2017. 11. 5. 23:34
# The source code (Two-dimensional arrary)
|
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 |
#include <stdio.h>
int graph[4][4]; // init with zero
void addEdge(int v1, int v2, int reverse)
{
graph[v1][v2] = 1;
if (reverse == 1)
{
graph[v2][v1] = 1;
}
}
void showAdjacentVertex(int v)
{
for (int i = 0; i < 4; i++)
{
if (graph[v][i] == 1)
{
printf("%d is a %d's adjacent vertex \n", i, v);
}
}
}
void main()
{
addEdge(0, 1, 1);
addEdge(0, 2, 0);
addEdge(0, 3, 1);
addEdge(1, 2, 1);
addEdge(1, 3, 0);
addEdge(1, 4, 1);
addEdge(2, 3, 1);
addEdge(2, 4, 1);
showAdjacentVertex(0);
} |
cs |
# The result(Two-dimensional arrary)
# The source code(SLL)
|
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 <stdio.h>
#include <stdlib.h>
struct node
{
int v;
struct node * next;
};
struct node * graph[4];
void addEdge(int v1, int v2, int reverse)
{
struct node *new_one = (struct node *)malloc(sizeof(struct node));
struct node *cur = graph[v1];
new_one->v = v2;
new_one->next = 0;
if (cur == 0)
{
graph[v1] = new_one;
}
else
{
while (cur->next != 0)
{
cur = cur->next;
}
cur->next = new_one;
}
if (reverse == 1)
{
addEdge(v2, v1, 0);
}
return;
}
void showAdjacentVertex(int v)
{
struct node * cur = graph[v];
while (cur != 0)
{
printf("%d is a %d's adjacent vertex \n", cur->v, v);
cur = cur->next;
}
}
void main()
{
addEdge(0, 1, 1);
addEdge(0, 2, 0);
addEdge(0, 3, 1);
addEdge(1, 2, 1);
addEdge(1, 3, 0);
addEdge(1, 4, 1);
addEdge(2, 3, 1);
addEdge(2, 4, 1);
showAdjacentVertex(2);
} |
cs |
# The result(SLL)
