Directed Acyclic Graph is well described at Directed acyclic graph

One way to think of a Directed Acyclic Graph is as a set of dependencies—each node may have a dependency on one or more other nodes. That is, in order to get to Node B you must route through Node A, so Node B depends on Node A.

More Information#

There might be more information for this subject on one of the following:

Add new attachment

Only authorized users are allowed to upload new attachments.
« This page (revision-2) was last changed on 18-Apr-2017 11:01 by jim