start > Directed Acyclic Graph

Directed Acyclic Graph

Created by bassheide. Last edited by bassheide, 7 years and 19 days ago. Viewed 1,131 times. #1

[edit] [rdf]

labels

attachments

An acyclic digraph is a directed graph containing no directed cycles, also known as a directed acyclic graph or a "DAG." Every acyclic digraph has at least one node of outdegree 0. The numbers of acyclic digraphs on n = 1, 2, … vertices are 1, 2, 6, 31, 302, 5984, … (

Sloane's A003087).

no comments | post comment

see also:
DAG	snipsnap-index	SnipSnap/config	Grid Job Handler
snipsnap-search	Workflow Description L...	XPath	Directed+Acyclic+Graph