why djikstra algorithm can't solve graph with negative edge

Question

anonymous · Answer

hello

shadowfiend · Answer

The mechanics of the algorithm don't really allow it to. Dijkstra's algorithm immediately removes a node from consideration when the sum of existing weights and the shortest path weight to the node are higher than those of other nodes. With negative edge weights, a future edge could make one of those nodes viable again, but Dijkstra's algorithm will already have knocked it out of the running, so it won't be able to go through that node to find the shortest path.

Does that make sense?