max/graph-algorithms
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Better comments

Browse source
This commit is contained in:
GregorSamsa42 2024-07-24 15:57:30 +02:00
parent a2bc786543
commit 46bf5ed145
1 changed files with 6 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
top_order/top_order.cpp
View file

@ -1,5 +1,5 @@
// Kosaraju’s algorithm to find strongly connected components of a directed graph // Algorithm outputting a topological order of a directed graph
// Authors: Georǵi Kocharyan, Maximilian Keßler // Authors: Georǵi Kocharyan
#include <iostream> #include <iostream>
#include <cstdio> #include <cstdio>
@ -21,7 +21,9 @@ int main() {
// G.add_edge(0,3); // G.add_edge(0,3);
// G.add_edge(3,0); // G.add_edge(3,0);
// keeps track of vertices with zero indegree, these can be put at the beginning
std::stack<int> zero_indegree; std::stack<int> zero_indegree;
std::vector<int> indegs = G.indegrees(); std::vector<int> indegs = G.indegrees();
int amount = 0; int amount = 0;
@ -33,7 +35,7 @@ int main() {
amount++; amount++;
} }
} }
// update indegs, zero_indegree after adding a vertex to the top. order
while(!zero_indegree.empty()) while(!zero_indegree.empty())
{ {
int node_id = zero_indegree.top(); int node_id = zero_indegree.top();
@ -41,7 +43,7 @@ int main() {
std::cout << node_id << ' '; std::cout << node_id << ' ';
for(auto i: G.adjList(node_id)) for(auto i: G.adjList(node_id))
{ {
if (indegs[i] = 1) if (indegs[i] = 1) // this ensures each vertex added to stack only once
{ {
zero_indegree.push(i); zero_indegree.push(i);
amount++; amount++;