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.
(1994-12-07)

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
Previous Definition: directed
Next Definition: directed angle
More from Thesaurus.com
Synonyms and Antonyms for directed acyclic graph
More from Reference.com
Search for articles containing directed acyclic graph
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

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