greenDev7
diff --git a/‎Graph.cs
Lines changed: 1 addition & 39 deletions b/‎Graph.cs
Lines changed: 1 addition & 39 deletions
@@ -55,33 +55,6 @@ public class Graph
         /// <returns></returns>
         double Weight(Vertex v1, Vertex v2)
         {
-            #region Блок для тестирования            
-
-            if (IsWeightFromTo(v1, 0, 0, v2, 0, 1))
-                return 1.0;
-            if (IsWeightFromTo(v1, 0, 1, v2, 0, 2))
-                return 3.0;
-            if (IsWeightFromTo(v1, 0, 0, v2, 1, 0))
-                return 1.0;
-            if (IsWeightFromTo(v1, 1, 0, v2, 1, 1))
-                return 100.0;
-            if (IsWeightFromTo(v1, 1, 1, v2, 1, 2))
-                return 10.0;
-            if (IsWeightFromTo(v1, 0, 2, v2, 1, 2))
-                return 2.0;
-            if (IsWeightFromTo(v1, 0, 0, v2, 1, 1))
-                return 40.0;
-            if (IsWeightFromTo(v1, 1, 0, v2, 0, 1))
-                return 50.0;
-            if (IsWeightFromTo(v1, 0, 1, v2, 1, 2))
-                return 70.0;
-            if (IsWeightFromTo(v1, 1, 1, v2, 0, 2))
-                return 30.0;
-            if (IsWeightFromTo(v1, 0, 1, v2, 1, 1))
-                return 50.0;
-
-            #endregion
-
             (double, double) x1y1 = GetRealXY(v1);
             (double, double) x2y2 = GetRealXY(v2);
 
@@ -92,18 +65,7 @@ double Weight(Vertex v1, Vertex v2)
             double sumOfSquares = Math.Pow(xDiff, 2.0) + Math.Pow(yDiff, 2.0) + Math.Pow(zDiff, 2.0);
 
             return Math.Sqrt(sumOfSquares);
-        }
-
-        private bool IsWeightFromTo(Vertex v1, int x1, int y1, Vertex v2, int x2, int y2)
-        {
-            bool case1 = x1 == v1.Coordinate.i && y1 == v1.Coordinate.j &&
-                         x2 == v2.Coordinate.i && y2 == v2.Coordinate.j;
-
-            bool case2 = x1 == v2.Coordinate.i && y1 == v2.Coordinate.j &&
-                         x2 == v1.Coordinate.i && y2 == v1.Coordinate.j;
-
-            return case1 || case2;
         }
+        }      
 
         /// <summary>
         /// Возвращает кратчайший путь между двумя заданными вершинами графа и его длину