252 views
0 votes
0 votes

FOR THE EXTENDED-SHORTEST-PATH if we want to find the distance between 1->4 and the 1->5 +5->4 gives the shortest path and if 1->5  gets its shortest path as 1->2->5 and 5>4 gets its shortest path as 5->3->4 then how will we get it?? as one of the operands is always from the initial array.

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
Doraemon asked Mar 30, 2019
737 views
What are the strongly connected components in the above figure ?
1 votes
1 votes
1 answer
4
Abhilash Mishra asked Jul 4, 2018
673 views
Prove or disprove: If a directed graph G contains cycles, then TOPOLOGICAL SORT $(G)$ produces a vertex ordering that minimizes the number of “bad” edges that are inc...