issue #5 Fix

justcoding121 · justcoding121 · commit 93f1c6f190bd · 2018-01-22T20:22:00.000-05:00
diff --git a/Advanced.Algorithms/GraphAlgorithms/ShortestPath/Bellman-Ford.cs b/Advanced.Algorithms/GraphAlgorithms/ShortestPath/Bellman-Ford.cs
@@ -100,7 +100,7 @@ private ShortestPathResult<T, W> tracePath(WeightedDiGraph<T, W> graph,
             pathStack.Push(destination);
 
             var currentV = destination;
-            while (!currentV.Equals(default(T)) && !parentMap[currentV].Equals(default(T)))
+            while (!Equals(currentV, default(T)) && !parentMap[currentV].Equals(default(T)))
             {
                 pathStack.Push(parentMap[currentV]);
                 currentV = parentMap[currentV];
diff --git a/Advanced.Algorithms/GraphAlgorithms/ShortestPath/Dijikstra.cs b/Advanced.Algorithms/GraphAlgorithms/ShortestPath/Dijikstra.cs
@@ -178,7 +178,7 @@ private ShortestPathResult<T, W> tracePath(WeightedDiGraph<T, W> graph,
             pathStack.Push(destination);
 
             var currentV = destination;
-            while (!currentV.Equals(default(T)) && !parentMap[currentV].Equals(default(T)))
+            while (!Equals(currentV,default(T)) && !parentMap[currentV].Equals(default(T)))
             {
                 pathStack.Push(parentMap[currentV]);
                 currentV = parentMap[currentV];

Original file line number	Diff line number	Diff line change
`@@ -100,7 +100,7 @@ private ShortestPathResult<T, W> tracePath(WeightedDiGraph<T, W> graph,`
`100`	`100`	`pathStack.Push(destination);`
`101`	`101`
`102`	`102`	`var currentV = destination;`
`103`		`- while (!currentV.Equals(default(T)) && !parentMap[currentV].Equals(default(T)))`
	`103`	`+ while (!Equals(currentV, default(T)) && !parentMap[currentV].Equals(default(T)))`
`104`	`104`	`{`
`105`	`105`	`pathStack.Push(parentMap[currentV]);`
`106`	`106`	`currentV = parentMap[currentV];`
Original file line number	Diff line number	Diff line change
`@@ -178,7 +178,7 @@ private ShortestPathResult<T, W> tracePath(WeightedDiGraph<T, W> graph,`
`178`	`178`	`pathStack.Push(destination);`
`179`	`179`
`180`	`180`	`var currentV = destination;`
`181`		`- while (!currentV.Equals(default(T)) && !parentMap[currentV].Equals(default(T)))`
	`181`	`+ while (!Equals(currentV,default(T)) && !parentMap[currentV].Equals(default(T)))`
`182`	`182`	`{`
`183`	`183`	`pathStack.Push(parentMap[currentV]);`
`184`	`184`	`currentV = parentMap[currentV];`