Re: An added line to Tarjan's SCC algorithm in Muchnik's Advanced Compiler Design

David Lovemore <davidlovemore@gmail.com>
Fri, 17 Aug 2018 00:01:13 -0700 (PDT)

          From comp.compilers
Related articles
| List of all articles for this month |
From: David Lovemore <davidlovemore@gmail.com>
Newsgroups: comp.compilers
Date: Fri, 17 Aug 2018 00:01:13 -0700 (PDT)
Organization: Compilers Central
References: 18-08-001
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="69457"; mail-complaints-to="abuse@iecc.com"
Keywords: books
Posted-Date: 17 Aug 2018 10:40:00 EDT
In-Reply-To: 18-08-001

On Thursday, August 16, 2018 at 1:41:12 PM UTC+1, woon...@gmail.com wrote:
> The official errata for the book, Advanced Compiler Design and Implementation
> by Steven Muchnik added, among other fixes, this line to the Tarjan's algorithm
> to find maximal strongly connected components (SCCs) from a directed graph.
>
> All_SCC U= {{Stack[1]}}
>
> where I replaced with brackets an arrow to mean retrival of an element from a
> sequence named Stack. ...




I don't have the book, so I can't see implementation of
Strong_Components. But I believe the description of the algorithm on
wikipedia is correct. I suggest comparing with that.


https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.