In mathematics, and more specifically in graph theory, a directedgraph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs.
(DAG) A directed graph containing no cycles. This means
that if there is a route from node A to node B then there is
no way back.
(1994-12-07)
Wikipedia
Directed graph
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs.