directed acyclic graphWiktionary 原文释义（英文）名词 Noun(graph theory, computer science) A finite directed graph that contains no directed cycles.