-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTopological.cpp
168 lines (155 loc) · 3.47 KB
/
Topological.cpp
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
////#include<bits/stdc++.h>
////using namespace std;
////
////void topologicalSortUtils(vector<int>graph[],bool visited[],stack<int>&st,int i)
////{
//// visited[i]=true;
//// int n=graph[i].size();
////
//// for(int j=0;j<n;++j)
//// {
//// if(!visited[graph[i][j]])
//// {
//// topologicalSortUtils(graph,visited,st,graph[i][j]);
//// }
//// }
//// st.push(i);
////}
////
////void topologicalSort(vector<int>graph[],int v)
////{
//// bool visited[v];
//// stack<int>st;
////
//// for(int i=0;i<v;++i)
//// visited[i]=false;
//// for(int i=0;i<v;++i) {
//// if (!visited[i]) {
//// topologicalSortUtils(graph, visited, st, i);
//// }
//// }
//// while(!st.empty())
//// {
//// cout<<st.top()<<" ";
//// st.pop();
//// }
//// }
////
////int main()
////{
//// int v,e,s,d;cin>>v>>e;
//// vector<int>graph[v];
//// for(int i=0;i<e;++i)
//// {
//// cout<<"Enter the source and destination"<<" ";
//// cin>>s>>d;
//// graph[s].push_back(d);
//// }
//// topologicalSort(graph,v);
////}
//
//
//
//
//#include<bits/stdc++.h>
//using namespace std;
//
//void topologicalSortUtil(vector<int>graph[],bool visited[],stack<int>&st,int i)
//{
// visited[i]=true;
// int n=graph[i].size();
//
// for(int j=0;j<n;++j)
// {
// if(!visited[graph[i][j]])
// {
// topologicalSortUtil(graph,visited,st,graph[i][j]);
// }
// }
// st.push(i);
//}
//
//void topologicalSort(vector<int>graph[],int v)
//{
// bool visited[v];
// stack<int>st;
//
// for(int i=0;i<v;++i)
// visited[v]=false;
// for(int i=0;i<v;++i)
// {
// if(!visited[i])
// {
// topologicalSortUtil(graph,visited,st,i);
// }
// }
// while(!st.empty())
// {
// cout<<st.top();
// st.pop();
// }
//}
//
//int main()
//{
// int v,e,s,d;
// cout<<"Enter the Vertex and Edges -> "<<"\n";
// cin>>v>>e;
// vector<int>graph[v];
// for(int i=0;i<e;++i)
// {
// cout<<"Enter the Source and Destination:"<<"\n";
// cin>>s>>d;
//
// graph[s].push_back(d);
// }
// cout<<"TOPOLOGICAL SORT representation :"<<"\n";
// topologicalSort(graph,v);
//}
#include<bits/stdc++.h>
using namespace std;
void topologicalSortUtils(vector<int>graph[],bool visited[],stack<int>&st,int i)
{
visited[i]=true;
int n=graph[i].size();
for(int j=0;j<n;++j)
{
if(!visited[graph[i][j]])
{
topologicalSortUtils(graph,visited,st,graph[i][j]);
}
}
st.push(i);
}
void topologicalSort(vector<int>graph[],int v)
{
bool visited[v];
stack<int>st;
for(int i=0;i<v;++i)
visited[i]=false;
for(int i=0;i<v;++i) {
if (!visited[i]) {
topologicalSortUtils(graph, visited, st, i);
}
}
while(!st.empty())
{
cout<<st.top();
st.pop();
}
}
int main()
{
int v,e,s,d;
cout<<"Enter the Vertex and Edges -> "<<"\n";
cin>>v>>e;
vector<int>graph[v];
for(int i=0;i<e;++i)
{
cout<<"Enter the Source and Destination:"<<"\n";
cin>>s>>d;
graph[s].push_back(d);
}
cout<<"TOPOLOGICAL SORT representation :"<<"\n";
topologicalSort(graph,v);
}