directed acyclic graph

Computing Dictionary

directed acyclic graph definition

(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.

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: directed
Next Definition: directed angle
More from
Synonyms and Antonyms for directed acyclic graph
More from
Search for articles containing directed acyclic graph Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature