Noun
acyclic digraph (plural acyclic digraphs) (graph theory, computer science) A directed acyclic graph, a finite directed graph that contains no directed cycles.