Consider the graph adjacency matrix
1 2 3 4 5
1 0 1 0 1 0
2 0 0 1 1 1
3 1 0 0 0 0
4 0 0 1 0 0
5 0 0 0 1 0
How many paths are there from vertex 1 to vertex 5 of length either 1 edge or 2 edges or3 edges or 4 edges?
a) 2
b)3
c) 4
d) 5
Answers
Answered by
9
Answer:
4 is a right answer bro
Explanation:
Similar questions