所以基本上我需要使用 goroutine 做一個(gè) Dijkstra 程序。除了 goroutine 有一點(diǎn)問(wèn)題，我基本上什么都做了。由于它是 Dijkstra 算法，因此我使用一個(gè)函數(shù)來(lái)查找從給定節(jié)點(diǎn)到所有其他節(jié)點(diǎn)的最短路徑。goroutine 必須幫助我找到從 n 到 n 節(jié)點(diǎn)的最短路徑，如下面的代碼所示。//This function will get us all the shortest paths from all the nodes to all the other nodes//list []Edge here is our list containing all the characteristics given by the .txt file//nodes []int gives us all the nodes in our graph//map[int]map[int][]int is all the results for the paths for e.g {1:{2:[1 2](the paths that it took) 3:[1 3]...} 2:{1:{2 1}...}...}//map[int]map[int]int is all the distances for the different paths for e.g {1:{2:1 3:2 4:3...},2...}func Dijkstra(list []Edge, nodes []int) (map[int]map[int][]int, map[int]map[int]int) {    var wg sync.WaitGroup // Waitgroup so that we won't get some things done before all the goroutines are done    dijk := make(map[int]map[int][]int)    distance := make(map[int]map[int]int)    //start := time.Now()    neighbors := getAllNeighbors(list, nodes)    //fmt.Print(neighbors)    //We get all the neighbors for every node we have in our graph    //{1:[{1 2 1},{1 3 2}],B:...}    for _, node := range nodes { //for every node we have we are going to get the shortest path to all the other nodes        var routes map[int][]int        var distances map[int]int        wg.Add(1)   //We add our next goroutine in the waitgroup        go func() { //goroutine            routes, distances = oneDijkstra(node, &wg, list, nodes, neighbors) //function that will give us the shortes path from the node to other nodes of the list        }    }}問(wèn)題是這段代碼在其實(shí)際狀態(tài)下并不能很好地使用 goroutines。我想知道我應(yīng)該把它放在哪里以使我的結(jié)果更快（因?yàn)檫@里就像沒(méi)有 goroutines）。提前感謝任何能夠給我一些解決方案的人。