Well, if I remember my graph theory well enough, if A is the adjacency matrix of the graph, each entry of A^n is the number of ways to get between the corresponding nodes in n steps or less. So, to do ...

In mathematics and computer science, a directed acyclic graph, is a finite directed graph with no directed cycles. It consists of finitely many vertices and edges, with each edge directed from one ...