Acyclic graph

An Acyclic Graph is a graph which does not have a path that starts and ends on the same node (does not create a cycle), e.g. a binary tree. These graphs can be either non directional, in the sense of a network map, or directed in the sense of a the blockchain where one block has a dependency upon the previous block which in turn has a dependency upon the previous block.