Question

Consider the graph adjacency matrix
1 2 3 4 5
1 0 1 0 1 0
20 0 1 1 1
31 0 0 0 0
4 0 0 10 0
5 0 0 0 1 0
15:00 011 10
How many paths are there from vertex 1 to vertex 5 of length either 1 edge or 2 edges or 3
edges or 4 edges?
N
a) 2
b)3
c) 4
d) 5​

Answer 1

Answer:

hey I can't understand your question please write in proper way please

Answer 2

Answer:

can you take photo and keep the question because it is not understanding