From: Gregory Seidman (gseidman_at_[hidden])
Date: 2001-01-08 14:31:29
Jon Kalb sez:
} At 2:18 PM -0500 1/5/01, Beman Dawes wrote:
} >There was discussion of Boost as evolving into a hierarchy (or DAG) of
} >communities, along domain lines.
} What means "DAG"?
Directed Acyclic Graph, as opposed to a tree (hierarchy) in this case. This
is a tree (assume all edges are directed down the page):
This is a DAG:
In a tree, every (non-root) node has exactly one parent. In a DAG, every
(non-root) node has at least one parent.
} Sign me "Clueless in Santa Clara"
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk