algorithms/dfs.c at master · RonitRay/algorithms · GitHub

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
#include < stdio.h >

int a[20][20], reach[20], n;
void dfs(int v)
{
    int i;
    reach[v] = 1;
    for (i = 1; i <= n; i++)
        if (a[v][i] && !reach[i])
        {
            printf("%d->%d", v, i);
            dfs(i);
        }
}

void main()
{
    int i, j, count = 0;
    clrscr();
    printf("Enter number of vertices:");
    scanf("%d", & n);
    for (i = 1; i <= n; i++)
    {
        reach[i] = 0;
        for (j = 1; j <= n; j++)
            a[i][j] = 0;
    }

    printf("Enter the adjacency matrix:");

    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            scanf("%d", & a[i][j]);
    dfs(1);
    printf("n");
    for (i = 1; i <= n; i++)
        if (reach[i])
            count++;
    if (count == n)
        printf("Graph is connected");
    else
        printf("Graph is not connected");
}