CPPCodeSnippets/findPath.cpp at master · rnagasudhakar/CPPCodeSnippets · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include<bits/stdc++.h>
using namespace std;
#define ll long long

// bool findPath(vector<vector<int>> &graph, int curr, map<int,int> m, vector<int>&  path, vector<int>&visited) {
//        visited[curr] = 1;
//        for(auto it:graph[curr]){
//        		if(visited[it]) continue;
//        		if(findPath(graph,it,m,path,visited)){
//        			path.push_back(curr);
//        		}
//        }

//        if(m.find(curr)!=m.end()){
//        	return true;
//        }
//        else{
//        	return false;
//        }
// }


bool findPath(vector<vector<int>> &graph, int curr, int par, vector<int>&  path,  vector<vector<int>> &visited, map<int,int> &m) {
       visited[curr][par] = 1;
       path.push_back(curr);
       bool flg = false;
       if(m.find(curr)!=m.end()){
       	flg=1;
       }
       for(auto it:graph[curr]){
       		if(visited[it][curr]) continue;
       		flg = flg | findPath(graph,it,curr,path,visited,m);
       }
       if(!flg){
       	path.pop_back();
       }
       return flg;
}


int main(){

	int nodes,edges;
	cin>>nodes>>edges;
	vector<vector<int>> edge;
	for(int i=0;i<edges;i++){
		int sou,des;
		cin>>sou>>des;
		edge.push_back({sou,des});
	}

	vector<vector<int>> graph(nodes);
    for(int i=0;i<edges;i++){
    	int sou = edge[i][0];
    	int des = edge[i][1];
    	graph[sou].push_back(des);
    	graph[des].push_back(sou);
    }

    int ele;
    cin>>ele;
    vector<int> element(ele);
    for(int i=0;i<ele;i++){
    	cin>>element[i];
    }

    map<int,int> m;
    for(auto i:element){
    	m[i]++;
    }
    vector<int> path;

    vector<vector<int>> visited(nodes,vector<int>(nodes,0));

    findPath(graph,0,0,path,visited,m);

    for(auto it:path){
    	cout<<it<<" ";
    }

	return 0;
}