Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.compilers > #2105

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

Show all headers | View raw

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.

The full context (p.195) reads as

    ... some declarations and init code omitted...
    for each x from node sets do
        if Dfn(x) = 0 then
            Strong_Components(x,Succ)
        fi
    od
    All_SCC U= {{Stack[1]}}

The original paper has no such line and I failed to figure out when it is
necessary.

It seems to imply the stack has one node that should be added to the set of
SCCs, but AFAIK the stack should be empty when returning an initial call to
Strong_Components() above. What am I missing here, or is this another added bug
as ones for Tarjan's dominator algorithm?

Thanks in advance.

Back to comp.compilers | Previous | Next — 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