我目前已經(jīng)實現(xiàn)了 Dijkstra 的算法，但是當我用這樣的圖測試我的算法時出現(xiàn)了問題：并嘗試從 C 轉(zhuǎn)到 B。我知道為什么它不起作用。但是我想知道如果有這樣的圖表，正常的實現(xiàn)是否會起作用？  internal static Stack<string> Dijkstra(string sourcePoint, string targetPoint, Graph graph)    {        List<string> verticesStringList = graph.GetAllVertices();        Dictionary<string, Vertex> verticesDictionary = new Dictionary<string, Vertex>();        InitializeVerticesDictionary(sourcePoint, verticesStringList, verticesDictionary);        while (verticesDictionary.Values.ToList().Any(x => x.IsVisited == false))        {            KeyValuePair<string, Vertex> keyValuePair = verticesDictionary.Where(x => x.Value.IsVisited == false).ToList().Min();            string vertexKey = keyValuePair.Key;            Vertex currentVertex = keyValuePair.Value;            List<string> neighbourVertices = graph.GetNeighbourVerticesSorted(keyValuePair.Key);            foreach (string neighbourVertexString in neighbourVertices)            {                Vertex neighbourVertex = verticesDictionary[neighbourVertexString];                int newDistanceFromStartVertex = currentVertex.ShortestDistanceFromTarget + graph.GetEdgeWeight(keyValuePair.Key, neighbourVertexString);                if (newDistanceFromStartVertex < neighbourVertex.ShortestDistanceFromTarget)                {                    verticesDictionary[neighbourVertexString].ShortestDistanceFromTarget = newDistanceFromStartVertex;                    verticesDictionary[neighbourVertexString].PreviousVertex = keyValuePair.Key;                }            }            verticesDictionary[vertexKey].IsVisited = true;        }        return FormShortestPath(targetPoint, verticesDictionary);    }更新：我改變了我的條件verticesDictionary.Values.ToList().Any(x => x.IsVisited == false && x.ShortestDistanceFromTarget != int.MaxValue)，現(xiàn)在我沒有得到我在評論中提到的溢出。