Great idea but two typos. Multiplying the adjacency matrix by itself gives the number of walks of a specified length. Therefore you would keep multiplying the

Great idea but two typos. Multiplying the adjacency matrix by itself gives the number of walks of a specified length. Therefore you would keep multiplying the matrix by itself until all values are nonzero. Then the previous iteration shows a zero where the longest routes are.