mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
commit
836d6a055a
27
Graph/DFS.cpp
Normal file
27
Graph/DFS.cpp
Normal file
@ -0,0 +1,27 @@
|
|||||||
|
#include <bits/stdc++.h>
|
||||||
|
using namespace std;
|
||||||
|
int v = 4;
|
||||||
|
void DFSUtil_(int graph[4][4],bool visited[],int s){
|
||||||
|
visited[s] = true;
|
||||||
|
cout<<s<<" ";
|
||||||
|
for(int i=0;i<v;i++){
|
||||||
|
if(graph[s][i]==1&&visited[i]==false){
|
||||||
|
DFSUtil_(graph,visited,i);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void DFS_(int graph[4][4],int s){
|
||||||
|
bool visited[v];
|
||||||
|
memset(visited,0,sizeof(visited));
|
||||||
|
DFSUtil_(graph,visited,s);
|
||||||
|
}
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
int graph[4][4] = {{0,1,1,0},{0,0,1,0},{1,0,0,1},{0,0,0,1}};
|
||||||
|
cout<<"DFS: ";
|
||||||
|
DFS_(graph,2);
|
||||||
|
cout<<endl;
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user