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

From	David Lovemore <davidlovemore@gmail.com>
Newsgroups	comp.compilers
Subject	Re: An added line to Tarjan's SCC algorithm in Muchnik's Advanced Compiler Design
Date	2018-08-17 00:01 -0700
Organization	Compilers Central
Message-ID	<18-08-003@comp.compilers> (permalink)
References	<18-08-001@comp.compilers>

Show all headers | View raw

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

Back to comp.compilers | Previous | Next — Previous in thread | Next in thread | Find similar

Thread

An added line to Tarjan's SCC algorithm in Muchnik's Advanced Compiler Design woong.jun@gmail.com - 2018-08-15 20:48 -0700
  Re: An added line to Tarjan's SCC algorithm in Muchnik's Advanced Compiler Design David Lovemore <davidlovemore@gmail.com> - 2018-08-17 00:01 -0700
    Re: An added line to Tarjan's SCC algorithm in Muchnik's Advanced Compiler Design woong.jun@gmail.com - 2018-08-24 00:40 -0700
      Re: An added line to Tarjan's SCC algorithm in Muchnik's Advanced Compiler Design David Lovemore <davidlovemore@gmail.com> - 2018-08-27 04:51 -0700

csiph-web