dijkstra算法修正

common/Tnb.Common/Utils/Dijkstra.cs

@@ -62,15 +62,15 @@ namespace Tnb.Common.Utils
                     mVexs[p1].firstEdge = node1;
                 else
                     LinkLast(mVexs[p1].firstEdge, node1);
-                // 初始化node2
-                ENode node2 = new ENode();
-                node2.ivex = p1;
-                node2.weight = weight;
-                // 将node2链接到"p2所在链表的末尾"
-                if (mVexs[p2].firstEdge == null)
-                    mVexs[p2].firstEdge = node2;
-                else
-                    LinkLast(mVexs[p2].firstEdge, node2);
+                //// 初始化node2
+                //ENode node2 = new ENode();
+                //node2.ivex = p1;
+                //node2.weight = weight;
+                //// 将node2链接到"p2所在链表的末尾"
+                //if (mVexs[p2].firstEdge == null)
+                //    mVexs[p2].firstEdge = node2;
+                //else
+                //    LinkLast(mVexs[p2].firstEdge, node2);
             }
         }