Directed acyclic graph
From Algorithmist
A directed acyclic graph, or DAG, is a directed graph containing no directed cycles.
Views
Personal tools
- This page was last modified on 3 August 2009, at 00:02.
- This page has been accessed 2,590 times.
- Content is available under GNU Free Documentation License 1.2.
- Privacy policy
- About Algorithmist
- Disclaimers