backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-05 11:40:46 +08:00
Code Issues Projects Releases Wiki Activity

Fix linter warnings in fixgraph branch.

Browse Source
This commit is contained in:
Filip Hlásek
2020-08-01 22:55:50 -07:00
parent c107f99db9
commit e2f344c498
8 changed files with 92 additions and 131 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
graph/topological_sort.cpp
View File

@@ -10,8 +10,9 @@ std::vector<int> ans;
void dfs(int v) {
visited[v] = true;
for (int u : G[v]) {
if (!visited[u])
if (!visited[u]) {
dfs(u);
}
}
ans.push_back(v);
}
@@ -20,15 +21,16 @@ void topological_sort() {
visited.assign(n, false);
ans.clear();
for (int i = 0; i < n; ++i) {
if (!visited[i])
if (!visited[i]) {
dfs(i);
}
}
reverse(ans.begin(), ans.end());
}
int main() {
std::cout << "Enter the number of vertices and the number of directed edges\n";
std::cin >> n >> m;
int x, y;
int x = 0, y = 0;
G.resize(n, std::vector<int>());
for (int i = 0; i < n; ++i) {
std::cin >> x >> y;