Consider the following adjacency matrix:0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 1 1 1 0 1 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 0 1 I need to find the number of paths (repeated vertices are allowed) from node 8 to node 5 of length 6.What methods are there? I want to know how to do this by multiplying matrices but no one has given me a good answer.
How to find number of paths between 2 nodes of a certain length
adjacency matrix