從源到圖中所有節點的最短路徑距離 - O(m + n log(n)) 時間 [英]Shortest path distance from source(s) to all nodes in the graph - O(m + n log(n)) time