directed acyclic graph
 

* 1.directed acyclic graph(dag) a directed graph containing no cycles. this means that if there is a route from node a to node b then there is no way back

English Related Words* acyclic

* acyclic machine

* adjacency graph

* area graph

* as directed

* associative graph

* bar graph

* bipartite graph

* column graph

* complete graph

* connected graph

* crest clearance graph

* de bruijn graph

* determinant of a graph

* directed