void DFS(int here) { visited[here] = true; for (int there = 0; there < 6; there++) { if (adjecent[here][there] == 0) continue; if (visited[here] == false) DFS(there); } }