#include <stdio.h>

const int n = 3, graph[3][3] = {{0, 1, 1},
                                {0, 0, 1},
                                {1, 0, 0}};
int visited[3] =   {0, 0, 0};

void dfs(int u) {
        visited[u] = 1;
        for(int v = 0; v < n; ++v)
                if(graph[u][v] && !visited[v])
                        dfs(v);
}

int main() {
        const int source = 0;
        for(int i = 0; i < n; ++i)
                for(int j = 0; j < n; ++j)
                        if(graph[i][j]) {
                                // i is connected with j
                        }
        dfs(source);
        return 0;
}