Computer Science, asked by amruthammu420, 4 months ago

Consider the graph adjacency matrix
1 1 2 3 4 5
1 011010
2001 1 | 1
3 1 0 0 0 0
400100
5000 1 0
1
how manypaths are there from vertex 1 to vertex 5 of length either 1 edge or 2 edges or 3 edges or 4 edges?​

Answers

Answered by bpranav506
1

Answer:

happy republic day

happy republic day

Similar questions