Dijkstra's algorithm does not handle negative edge weights well, as it can lead to incorrect shortest path calculations. If a graph contains negative edge weights, an alternative algorithm like the Bellman-Ford algorithm should be used, which can handle negative weights and detect negative weight cycles.