An acyclic graph is a graph without any cycles (basically no walks of length > 2 that have the same start and end node).