FreeChainXenon/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

graphds: Fix description of SCC algorithm

Browse source 
graphds_scc says that it uses Tarjan's algorithm, but it looks like
it uses Kosaraju's algorithm instead (dfs one way followed by dfs
the other way).

gcc/
	* graphds.cc (graphds_scc): Fix algorithm attribution.
This commit is contained in:
Richard Sandiford 2022-07-22 15:05:57 +01:00
parent 18ef76d3a1
commit 41da4070a2
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
gcc/graphds.cc
View file

@ -276,7 +276,7 @@ graphds_dfs (struct graph *g, int *qs, int nq, vec<int> *qt,
}
/* Determines the strongly connected components of G, using the algorithm of
Tarjan -- first determine the postorder dfs numbering in reversed graph,
Kosaraju -- first determine the postorder dfs numbering in reversed graph,
then run the dfs on the original graph in the order given by decreasing
numbers assigned by the previous pass. If SUBGRAPH is not NULL, it
specifies the subgraph of G whose strongly connected components we want