backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-03 02:29:53 +08:00
Code Issues Projects Releases Wiki Activity

style: format code

Browse Source
This commit is contained in:
yanglbme
2019-08-21 10:10:08 +08:00
parent abc0d365de
commit 69ddc9fc52
101 changed files with 3154 additions and 2984 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
Graph/DFS.cpp
View File

@@ -1,27 +1,31 @@
#include <bits/stdc++.h>
using namespace std;
int v = 4;
void DFSUtil_(int graph[4][4],bool visited[],int s){
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);
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){
void DFS_(int graph[4][4], int s)
{
bool visited[v];
memset(visited,0,sizeof(visited));
DFSUtil_(graph,visited,s);
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;
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;
}