Consider the graph adjacency matrix1 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
Answers
Answered by
0
Answer:
2 is the answer
Explanation:
mark as brainliest
Answered by
0
Answer:
2 is the answer
Explanation:
good morning have a nice day
Similar questions