Definition:Acyclic Graph
From ProofWiki
Definition
An acyclic graph is a graph or digraph with no cycles.
An acyclic connected undirected graph is a tree.
An acyclic unconnected undirected graph is a forest.
