issue-19 refactor

Author: matiii

src/Dijkstra.NET.Tests/Dijkstra.NET.Tests.csproj

@@ -1,4 +1,4 @@
-<Project Sdk="Microsoft.NET.Sdk">
+<Project Sdk="Microsoft.NET.Sdk">
 
   <PropertyGroup>
     <TargetFramework>netcoreapp2.0</TargetFramework>

src/Dijkstra.NET.Tests/Extensions/ShortestPathExtensionsTests.cs renamed to src/Dijkstra.NET.Tests/ShortestPath/DijkstraExtensionsTests.cs

@@ -3,9 +3,9 @@
 using Dijkstra.NET.ShortestPath;
 using Xunit;
 
-namespace Dijkstra.NET.Tests.Extensions
+namespace Dijkstra.NET.Tests.ShortestPath
 {
-    public class ShortestPathExtensionsTests
+    public class DijkstraExtensionsTests
     {
         [Fact]
         public void DijkstraGraphShould_Find_Path_In_Multi_Paths_Graph()

src/Dijkstra.NET/ShortestPath/DijkstraExtensions.cs

@@ -31,35 +31,5 @@ public static ShortestPathResult Dijkstra<T, TEdgeCustom>(this IGraph<T, TEdgeCu
         {
             return ShortestPath.Dijkstra.GetShortestPath(graph, from, to, depth);
         }
-        
-        /// <summary>
-        /// Get path from @from to @to
-        /// </summary>
-        /// <param name="graph">Source graph</param>
-        /// <param name="from">Start node</param>
-        /// <param name="to">End node</param>
-        /// <returns>Value with path</returns>
-        public static ShortestPathResult DijkstraBinary<T, TEdgeCustom>(this IGraph<T, TEdgeCustom> graph, uint from, uint to)
-            where TEdgeCustom : IEquatable<TEdgeCustom> => DijkstraBinary(graph, from, to, Int32.MaxValue);
-        
-        /// <summary>
-        /// Get path from @from to @to
-        /// </summary>
-        /// <param name="graph">Source graph</param>
-        /// <param name="from">Start node</param>
-        /// <param name="to">End node</param>
-        /// <param name="depth">Depth of path</param>
-        /// <returns>Value with path</returns>
-        public static ShortestPathResult DijkstraBinary<T, TEdgeCustom>(this IGraph<T, TEdgeCustom> graph, uint from, uint to,
-            int depth)
-            where TEdgeCustom : IEquatable<TEdgeCustom>
-        {
-            var p1 = Task.Factory.StartNew(() => ShortestPath.Dijkstra.GetShortestPath(graph, from, to, depth, 2, 0));
-            var p2 = Task.Factory.StartNew(() => ShortestPath.Dijkstra.GetShortestPath(graph, from, to, depth, 2, 1));
-
-            Task.WaitAll(p1, p2);
-
-            return p1.Result.Distance < p2.Result.Distance ? p1.Result : p2.Result;
-        }
     }
 }

src/Dijkstra.NET/ShortestPath/ShortestPathResult.cs

@@ -47,5 +47,10 @@ public IEnumerable<uint> GetReversePath()
         }
 
         public IEnumerable<uint> GetPath() => GetReversePath().Reverse();
+
+        public override string ToString()
+        {
+            return $"({FromNode})-[{Distance}]->({ToNode})";
+        }
     }
 }