DFS.cpp

#include<iostream>
using namespace std;

void print(int **edges,int n,int sv,bool * visited){
    cout<<sv<<" ";
    visited[sv]=true;
    for(int i=0;i<n;i++){
        if(i==sv){
            continue;
        }
        if(edges[sv][i]==1){
            if(visited[i]){
                continue;
            }
            print(edges,n,i,visited);
        }
    }
}
int main(){
    int n;  //no.of vertices
    cin>>n;
    int e;  //no.of edges
    cin>>e;
    int **edges=new int*[n];     //created a 2D array of nXn
    for(int i=0;i<n;i++){
        edges[i]=new int[n];
        for(int j=0;j<n;j++){
            edges[i][j]=0;
        }
    }
    for(int i=0;i<e;i++){
        int f,s;    //f=firstvertex s=secondvertex
        cin>>f>>s;
        edges[f][s]=1;
        edges[s][f]=1;
    }
    bool *visited=new bool[n];
    for(int i=0;i<n;i++){
        visited[i]=false;
    }
    print(edges,n,0,visited);

   delete []visited;
   for(int i=0;i<n;i++){
    delete []edges[i];
   }
   delete []edges;
}