lp2

#include <iostream>
#include <vector>
#include <stack>
#include <omp.h>

using namespace std;

const int MAX = 100000;
vector<int> graph[MAX];
bool visited[MAX];

void dfs(int node) {
stack<int> s;
s.push(node);

while (!s.empty()) {
	int curr_node = s.top();

	if (!visited[curr_node]) {
    	visited[curr_node] = true;
	
	s.pop();
cout<<curr_node<<" ";

    	#pragma omp parallel for
    	for (int i = 0; i < graph[curr_node].size(); i++) {
        	int adj_node = graph[curr_node][i];
        	if (!visited[adj_node]) {
            	s.push(adj_node);
        	}
    	}
	}
}

}

int main() {
int n, m, start_node;
cout<<"Enter no. of Node,no. of Edges and Starting Node of graph:\n";
cin >> n >> m >> start_node;
//n: node,m:edges
cout<<"Enter pair of node and edges:\n";

for (int i = 0; i < m; i++) {
	int u, v;
	cin >> u >> v;
	

//u and v: Pair of edges
graph[u].push_back(v);
graph[v].push_back(u);
}

#pragma omp parallel for
for (int i = 0; i < n; i++) {
	visited[i] = false;
}

dfs(start_node);



return 0;

}

/*output
Enter no. of Node,no. of Edges and Starting Node of graph:
4 3 0
Enter pair of node and edges:
0 1
0 2
2 4
0 2 4 1
*/