Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- vector<int>nodes[100];
- int clr[100],cost[100],cnt=0;
- void dfs(int src)
- {
- if(clr[src]==1)
- {
- //printf("%d ",src);
- return;
- }
- clr[src]=1;
- for(int i=0; i<nodes[src].size(); i++)
- {
- dfs(nodes[src][i]);
- }
- printf("%d ",src);
- }
- int main()
- {
- int i,j,n,edge,source=2,u,v;
- scanf("%d %d",&n,&edge);
- for(i=0; i<edge; i++)
- {
- scanf("%d %d",&u,&v);
- nodes[u].push_back(v);
- nodes[v].push_back(u);
- }
- for(i=1; i<=n; i++)
- {
- printf("%d-->",i);
- for(j=0; j<nodes[i].size(); j++)
- {
- printf("%d ",nodes[i][j]);
- }
- printf("\n");
- }
- dfs(source);
- return 0;
- }
Add Comment
Please, Sign In to add comment