acyclic digraph


Also found in: Wikipedia.

acyclic digraph

[ā¦sīk·lik ′dī‚graf]
(mathematics)
A directed graph with no directed cycles.
References in periodicals archive ?
is an acyclic digraph with vertex set given by the blocks of [pi].
An activity network is an acyclic digraph, where the vertices represent events, and the direct edges represent the activities, to be performed in a project [1,2].
An activity network is an acyclic digraph N of n vertices and directed edges [a.
The running of process phases is subject to precedence restrictions whose there is associated the acyclic digraph G = (F,U), where if x, y [member of] F, then (x, y) [member of] U if and only if the beginning of the phase y need finishing of phase x.
Mathematically, they form an acyclic digraph (James, 2000).
The running of process phases is subject to precedence restrictions whose there is associated the acyclic digraph G = (F, U), where if x, y [member of] F, then (x, y) [member of] U if and only if the beginning of the phase y need finishing of phase x.
Indeed, a network whose underlying interaction graph is an acyclic digraph can only eventually end up in a configuration that will never change over time (aka.