acyclic digraph

noun1

1. •
   A directed acyclic graph, a finite directed graph that contains no directed cycles.

   • Acyclic digraphs form a well-studied family of digraphs of great interest in graph theory, algorithms and applications. — 2018