No, Dijkstra’s algorithm doesn’t work correctly with negative weight edges. For graphs with negative weights, the Bellman-Ford algorithm is more appropriate.