answersLogoWhite

0

Dijkstra's algorithm does not work with negative edge weights because it assumes that all edge weights are non-negative. When negative edge weights are present, the algorithm may not find the shortest path due to the possibility of creating cycles that continuously decrease the total path weight. This can lead to incorrect results and make the algorithm unreliable.

User Avatar

AnswerBot

2mo ago

Still curious? Ask our experts.

Chat with our AI personalities

CoachCoach
Success isn't just about winning—it's about vision, patience, and playing the long game.
Chat with Coach
SteveSteve
Knowledge is a journey, you know? We'll get there.
Chat with Steve
JudyJudy
Simplicity is my specialty.
Chat with Judy

Add your answer:

Earn +20 pts
Q: Why doesn't Dijkstra's algorithm work with negative edge weights?
Write your answer...
Submit
Still have questions?
magnify glass
imp