Directed Acyclic Graph

If connections are one-way, from v₁ to v₂, we say the graph is directed ; otherwise, it is undirected. A directed graph is sometimes called a digraph. Directed acyclic graphs or DAG representations such as trees are important in Computer Science.