acyclic graph (original) (raw)

Any graph that contains no cycles is an acyclic graph. A directed acyclic graph is often called a DAG for short.

For example, the following graph and digraph are acyclic.

| | | |