Depth First Search(DFS) of a Graph in CPP

dfs.cpp

#include <iostream>
using namespace std;

// DFS technique uses Stack. As, we are implementing it using recursion it automatically uses Stack structure

void DFS(int G[][7],int start,int n){
    static int visited[7] = {0};
    if(visited[start]!=1){
        cout << start << " ";
        visited[start] = 1;
        for(int i=1;i<n;i++){
            if(G[start][i]==1 && visited[i]!=1){
                DFS(G,i,n);
            }
        }
    }
}

int main(){
    
    int G[7][7]={{0,0,0,0,0,0,0},
               {0,0,1,1,0,0,0},
               {0,1,0,0,1,0,0},
               {0,1,0,0,1,0,0},
               {0,0,1,1,0,1,1},
               {0,0,0,0,1,0,0},
               {0,0,0,0,1,0,0}};
    DFS(G,4,7);
    
}