-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathTopologicalsort_using_dfs.cpp
More file actions
93 lines (56 loc) · 950 Bytes
/
Topologicalsort_using_dfs.cpp
File metadata and controls
93 lines (56 loc) · 950 Bytes
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
83
84
85
86
87
88
89
90
91
92
93
#include<bits/stdc++.h>
using namespace std;
void io()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
class Graph{
map<int,list<int>>l;
public:
void addEdge(int x,int y){
l[x].push_back(y);
}
void dfs_helper(int src, map<int,int> &visited,list<int> &ordering){
visited[src]=true;
for(auto nbr: l[src]){
if(!visited[nbr]){
dfs_helper(nbr,visited,ordering);
}
}
ordering.push_front(src);
}
void dfs(){
map<int , int> visited;
list<int> ordering;
for(auto i:l){
int node=i.first;
if(!visited[node]){
dfs_helper(node, visited,ordering);
}
}
for(int x:ordering)
cout<<x<<endl;
}
};
void solve()
{
Graph g;
g.addEdge(1,2);
g.addEdge(1,3);
g.addEdge(1,4);
g.addEdge(2,3);
g.addEdge(4,5);
g.addEdge(3,5);
g.addEdge(5,7);
g.addEdge(6,7);
g.dfs();
}
int32_t main()
{
io();
solve();
return 0;
}