OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: linter warnings for topological_sort. (#994)

Browse Source 
Approving for now to enable a PR that adds graph folder to the CI build system.
This commit is contained in:
Filip Hlasek 2020-08-07 09:52:44 -07:00 committed by GitHub
parent 418e876dfe
commit b36ce9a8c0
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 25 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

49
graph/topological_sort.cpp
View File

@ -1,47 +1,48 @@
#include <algorithm> #include <algorithm>
#include <iostream> #include <iostream>
#include <vector> #include <vector>
using namespace std;
int n, m; // For number of Vertices (V) and number of edges (E) int number_of_vertices, number_of_edges; // For number of Vertices (V) and number of edges (E)
vector<vector<int>> G; std::vector<std::vector<int>> graph;
vector<bool> visited; std::vector<bool> visited;
vector<int> ans; std::vector<int> topological_order;
void dfs(int v) { void dfs(int v) {
visited[v] = true; visited[v] = true;
for (int u : G[v]) { for (int u : graph[v]) {
if (!visited[u]) if (!visited[u]) {
dfs(u); dfs(u);
}
} }
ans.push_back(v); topological_order.push_back(v);
} }
void topological_sort() { void topological_sort() {
visited.assign(n, false); visited.assign(number_of_vertices, false);
ans.clear(); topological_order.clear();
for (int i = 0; i < n; ++i) { for (int i = 0; i < number_of_vertices; ++i) {
if (!visited[i]) if (!visited[i]) {
dfs(i); dfs(i);
}
} }
reverse(ans.begin(), ans.end()); reverse(topological_order.begin(), topological_order.end());
} }
int main() { int main() {
cout << "Enter the number of vertices and the number of directed edges\n"; std::cout << "Enter the number of vertices and the number of directed edges\n";
cin >> n >> m; std::cin >> number_of_vertices >> number_of_edges;
int x, y; int x = 0, y = 0;
G.resize(n, vector<int>()); graph.resize(number_of_vertices, std::vector<int>());
for (int i = 0; i < n; ++i) { for (int i = 0; i < number_of_edges; ++i) {
cin >> x >> y; std::cin >> x >> y;
x--, y--; // to convert 1-indexed to 0-indexed x--, y--; // to convert 1-indexed to 0-indexed
G[x].push_back(y); graph[x].push_back(y);
} }
topological_sort(); topological_sort();
cout << "Topological Order : \n"; std::cout << "Topological Order : \n";
for (int v : ans) { for (int v : topological_order) {
cout << v + 1 std::cout << v + 1
<< ' '; // converting zero based indexing back to one based. << ' '; // converting zero based indexing back to one based.
} }
cout << '\n'; std::cout << '\n';
return 0; return 0;
} }