|terminology: double-rooted DAG? firstname.lastname@example.org (Mark Harrison) (1998-03-03)|
|Re: terminology: double-rooted DAG? email@example.com (1998-03-06)|
|Re: terminology: double-rooted DAG? firstname.lastname@example.org (1998-03-06)|
|Re: terminology: double-rooted DAG? email@example.com (Vladimir Alexiev) (1998-03-07)|
|Retraction: terminology: double-rooted DAG? firstname.lastname@example.org (1998-03-07)|
|Re: terminology: double-rooted DAG? email@example.com (Mark Harrison) (1998-03-07)|
|Re: Retraction: terminology: double-rooted DAG? firstname.lastname@example.org (1998-03-08)|
|[2 later articles]|
|From:||"Mark Harrison" <email@example.com>|
|Date:||3 Mar 1998 10:55:01 -0500|
|Organization:||AsiaInfo Computer Networks, Beijing|
I have a DAG data structure that has two special
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.
I have been calling this a "doubly rooted DAG", but I
would like to know if there is a better or more
standard term for this. Also, any references to this
type of data structure would be appreciated.
In case I'm doing a bad job explaining, here's an
example... "x" is the head and "y" is the tail.
x -> a
x -> b
x -> c
a -> d
b -> d
b -> y
c -> y
Mark Harrison at AsiaInfo Computer Networks, Beijing China
Return to the
Search the comp.compilers archives again.