Log In
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.

in Programming 44 views

Please log in or register to answer this question.

Related questions

1 vote
1 answer
What are the strongly connected components in the above figure ?
asked Mar 30, 2019 in Algorithms Doraemon 145 views
1 vote
0 answers
suppose that a graph G has MST already computed. How quickly can we update the MST if we add a new vertex and incident edges to it. I know for the best case scenario when a single edge is incident from the newly added vertex. but for the worst case, when ... many edges. This will end up being linear time since we can reuse part of the DFS that we had already computed before detecting each cycle.
asked Aug 19, 2018 in Algorithms aambazinga 278 views
1 vote
0 answers
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 inconsistent with the ordering produced.
asked Jul 4, 2018 in Algorithms Abhilash Mishra 158 views
0 votes
0 answers
In BFS of a directed graph, we don't have forward edges.Only tree edge,cross edge or back edge. Below is a sample graph I have taken and classified edge types. Please verify guys whether it's correct. The algorithm I have used is the ... by "redtuna" in the selected answer here.
asked Nov 22, 2018 in Programming Ayush Upadhyaya 737 views