Depth first search DFS (adjacency matrix and adjacency table version)

Adjacency matrix version

#include<iostream>
using namespace std;
const int MAXV = 1000;// Maximum number of vertices  
const int INF = 1000000000;// set up INF For a large number  
int n=5;//n For the top points , This is set to 5, Respectively 0,1,2,3,4 
int G[MAXV][MAXV] = {// Store the adjacency matrix of the graph ,MAXV Is the maximum number of vertices 
	{INF,1,INF,INF,INF},
	{INF,INF,1,1,INF},
	{INF,1,INF,1,1},
	{1,1,1,INF,1},
	{1,INF,1,1,INF}
};
bool vis[MAXV] = {false};// If the vertex i Has been interviewed , be vis[i]==true. The initial value is false
void DFS(int u,int depth){//u Label the currently accessed vertex ,depth For depth  
	vis[u] = true;// Set up u Has been interviewed 
	// If necessary u Do something , It can be done here 
	// Here's for all u Start to enumerate the branch vertices that can be reached 
	cout<<" The summit is "<<u<<" "<<" Depth is "<<depth<<endl;// Yes u For the output  
	for(int v=0;v<n;v++){// For each vertex v 
		if(vis[v]==false&&G[u][v]!=INF) // If v Not visited , And u You can achieve v
			DFS(v,depth+1);// visit v, Depth plus 1 
	} 
} 

// Ergodic graph 
void DFSTrave(){ // Ergodic graph G 
	for(int u=0;u<n;u++){// For each vertex u 
		if(vis[u]==false){// If u Not visited  
			DFS(u,1); // visit u and u Connected block of the party ,1 Indicates that the initial is the first layer  
		}
	} 
} 
int main() {
	DFS(2,1);
}

Adjacent tables

#include<iostream>
#include<vector>
using namespace std;
const int MAXV = 1000;// Maximum number of vertices  
int n;//n For the top points 
vector<int> Adj[MAXV];// chart G Adjacency list 
bool vis[MAXV] = {false};// If the vertex i Has been interviewed , be vis[i]==true. The initial value is false
void DFS(int u,int depth){//u Label the currently accessed vertex ,depth For depth  
	vis[u] = true;// Set up u Has been interviewed 
	/* If necessary u Do something , You can do it here */
	for(int i=0;i<Adj[u].size();i++){// From the u All the peaks that can be reached by departure v 
		int v = Adj[u][v];
		if(vis[v] = false){// If v Not accessed  
			DFS(v,depth+1);// visit v, Depth plus 1 
		}
	} 
} 
// Ergodic graph G
void DFSTrave(){
	for(int u=0;u<n;u++){// For each vertex u 
		if(vis[u]==false){// If u Not visited  
			DFS(u,1);// visit u and u The connecting block ,1 Indicates that the initial test is the first layer  
		}
	}
} 
int main() {
	DFS(0,1);// From the top 0 Start depth first traversal  
}