In a directed network, a closed loop of directed edges can form a cycle. Directed acyclic networks (also known as directed acyclic graphs), which do not include any cycles, have an adjacency matrix with all of its nonzero elements above the diagonal. All of the eigenvalues of the adjacency matrix for directed acyclic graphs are zero.
