資料結構與演算法

(3 points) Given a weighted directed graph with potential negative edge weights, which of the following algorithms would you use to compute the shortest path from a single source to all other vertices?