In mathematics, particularly graph theory, and computer science, a directed acyclic graph is a directed graph with no directed cycles.
