asmrobot
2019-11-21 589ed88a5924a7494e21b95b6bbff5e46ff49ddd
src/RichCreator.Utility/PathFinding/Dijkstra.cs
@@ -75,9 +75,6 @@
            }
        }
        /// <summary>
        /// 查找最短路径
        /// </summary>
@@ -91,7 +88,7 @@
            var distances = new Dictionary<T, Int32>();
            var nodes = new List<T>();
            List<T> path = null;
            List<T> path = new List<T>();
            foreach (var vertex in edges)
            {
@@ -116,7 +113,6 @@
                if (smallest.Equals(finish))
                {
                    path = new List<T>();
                    while (previous.ContainsKey(smallest))
                    {
                        path.Add(smallest);