In this lecture we learnt how to multiply two matrices together and looked at how this can be useful when combined with what we learnt about the adjacency matrix in the last lecture.

Did you manage to find the cube of our original adjacency matrix, and so find how many paths exist between two nodes that take exactly 3 steps?