Dijkstra\'s algorithm can be used to determine shortest paths on graphs with som

Question

Dijkstra's algorithm can be used to determine shortest paths on graphs with some negative edge weights, as long as there are no negative cycles; however, the worst-case running time can be much worse than the O(|E| + |V| log |V|) given in for non-negative edge weights in lecture and CLRS because vertices that have come off the priority queue may have to be put back on. (a) G a modified version of Dijkstras algorithm that works for negative edge weights, as long as there are not negative cycles. (b) Construct an infinite family of graphs (with negative edge weights) for which the asymptotic running time of this algorithm is Ohm(2^|V|).

Explanation / Answer

bellman ford algorithm is used

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.