[Solved] Number Unique Paths Start N Adjacency Matrix Given Sorted List Edges Edge X Y Directed Acy Q37226944

Number of unique paths from start to ‘n’ from an adjacencymatrix:

Given a sorted list of edges (each edge is from X to Y) in a(directed acyclic graphs):

n (# of the biggest node) == 6 in this case

m (# of edges) = 8 in this case

Given an adjacency matrix, I need a PYTHON program to give methe longest path (and how many longest paths exist) and a shortestpath (and how many shortest paths exist).

From the data above, this is what I think it should be. I justdon’t know how to find all possible paths from start to n by ONLYusing an adjacency matrix. Please help!

SHORTEST PATH: 2

# OF SHORTEST PATHS: 1

LONGEST PATH: 3

# OF LONGEST PATHS: 3

2 2 6 sts 50 0 Show transcribed image text 2 2 6 sts 50 0

Expert Answer

---

Answer to Number of unique paths from start to ‘n’ from an adjacency matrix: Given a sorted list of edges (each edge is from X to … . . .