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

00:10

00:09

00:08

00:07

00:06

00:05

00:04

00:03

00:02

00:01

Directed acyclic graph is always a great word to know.
So is zedonk. Does it mean:
a scrap or morsel of food left at a meal.
the offspring of a zebra and a donkey.
Dictionary.com, LLC. Copyright © 2012. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature
FAVORITES
RECENT