Re: terminology: double-rooted DAG?

dwight@pentasoft.com (Dwight VandenBerghe)
6 Mar 1998 16:52:07 -0500

          From comp.compilers
Related articles
terminology: double-rooted DAG? markh@usai.asiainfo.com (Mark Harrison) (1998-03-03)
Re: terminology: double-rooted DAG? mfinney@inmind.com (1998-03-06)
Re: terminology: double-rooted DAG? dwight@pentasoft.com (1998-03-06)
Re: terminology: double-rooted DAG? vladimir@cs.ualberta.ca (Vladimir Alexiev) (1998-03-07)
Re: terminology: double-rooted DAG? markh@usai.asiainfo.com (Mark Harrison) (1998-03-07)
Re: terminology: double-rooted DAG? mfinney@inmind.com (1998-03-08)
| List of all articles for this month |
From: dwight@pentasoft.com (Dwight VandenBerghe)
Newsgroups: comp.compilers
Date: 6 Mar 1998 16:52:07 -0500
Organization: All USENET -- http://www.Supernews.com
References: 98-03-021
Keywords: theory, comment

>I have a DAG data structure that has two special
>features:
>
>1. It always has a defined root node (like a tree), and
>2. There is also a "tail" node, which is like the root
> node except at the opposite end of the graph.


Isn't this what is called a "converging" or "confluent"
DAG?


Dwight
[This thing sure has a lot of names. -John]
--

Post a followup to this message

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