来自Graphs.jl的{{3}}：
Dijkstra的算法
dijkstra_shortest_paths(graph, edge_dists, source[, visitor])
Performs Dijkstra’s algorithm to find shortest paths to all vertices from input sources.
Parameters:
graph – The input graph
edge_dists – The vector of edge distances or an edge property inspector.
source – The source vertex (or vertices)
visitor – An visitor instance
Returns:
An instance of DijkstraStates that encapsulates the results.
它说source是源顶点或顶点。这是否意味着这个功能可以处理多个来源？
我有兴趣找到从多个来源到多个目的地的最短路径。我可以使用这个功能吗？那么，结果中parents数组的结构是什么？