DIRECTEDACYCLICGRAPH
Directed acyclic graph
In mathematics and computer science, a directed acyclic graph, is a directed graph with no directed cycles. That is, it is formed by a collection of vertices and directed edges, each edge connecting one vertex to another, such that there is no way to start at some vertex v and follow a sequence of edges that eventually loops back to v again.The above text is a snippet from Wikipedia: Directed acyclic graph
and as such is available under the Creative Commons Attribution/Share-Alike License.