Advanced Search

Question: Given a graph G , vertex v enumerate all possible shortest paths

Question:Given a graph G , vertex v enumerate all possible shortest paths

vs140580 495 Maple
graphtheory shortest-path
July 14 2022
1

Give a graph G enumerate all possible shortest paths from that vertex to all other vertices like

From vertex v1

P1={(1,2),(2,3)} shortest path from 1 to 3 is stored in P1

P2={(1,2)} shortest path from 1 to 2 of length 1 

Put all possible path of length k  from a verex v in a list seperate

That is length 1 in a seperate from vertex v in a seperate list 

Etc

Function with be F(Graph::G,v)

Function will return all those lists
Please Wait...