Does the same as Dijkstra, but

• larger time complexity: $n^2 log n$
• also works for graphs with negative weights