Acyclic graph

A directed graph or undirected graph is acyclic if it contains no cycles.