aboutsummaryrefslogtreecommitdiff
path: root/gcc/graphds.cc
diff options
context:
space:
mode:
authorPhilip Herron <philip.herron@embecosm.com>2022-08-23 14:29:23 +0100
committerPhilip Herron <philip.herron@embecosm.com>2022-08-23 14:31:03 +0100
commit57f0c9d6464c95807e836844f3013ed67948a16e (patch)
tree2a6b2ddf4fb364ebbc3699bcede6f40466f80aaa /gcc/graphds.cc
parent8d1a6deb4e69e7dc162e741377674cf03459bcd9 (diff)
parentbaa3ffb19c54fa334ac2884f6acb5d31aa79ac32 (diff)
downloadgcc-57f0c9d6464c95807e836844f3013ed67948a16e.zip
gcc-57f0c9d6464c95807e836844f3013ed67948a16e.tar.gz
gcc-57f0c9d6464c95807e836844f3013ed67948a16e.tar.bz2
Merge remote-tracking branch 'gcc/master' into phil/gcc-upstream-merge
This merges GCC as of baa3ffb19c54fa334ac2884f6acb5d31aa79ac32 into gccrs
Diffstat (limited to 'gcc/graphds.cc')
-rw-r--r--gcc/graphds.cc2
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/graphds.cc b/gcc/graphds.cc
index f4c83e8..91a2ca5 100644
--- a/gcc/graphds.cc
+++ b/gcc/graphds.cc
@@ -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