Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| 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) |
| From: | mfinney@inmind.com |
| Newsgroups: | comp.compilers |
| Date: | 6 Mar 1998 16:48:42 -0500 |
| Organization: | In Mind, Inc. |
| References: | 98-03-021 |
| Keywords: | theory |
Its called a "lattice". One of the definitions of a lattice is that it
is a dag which contains both a least upper bound and greatest lower
bound -- precisely what you have described.
"Mark Harrison" <markh@usai.asiainfo.com> writes:
:>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.
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.