Enumerating all simple paths in a graph

Warshail's Theorem is used to obtain a matrix power algorithm for enumerating all simple paths in a graph. The algorithm uses
O(N^{3})
matrix operations, compared to
O(N^{4})
operations for previous algorithms.