diff --git a/Advanced.Algorithms/GraphAlgorithms/ShortestPath/Bellman-Ford.cs b/Advanced.Algorithms/GraphAlgorithms/ShortestPath/Bellman-Ford.cs
index aaa4b0b6..8f73ce45 100644
--- 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 (!Equals(currentV, default(T)) && !parentMap[currentV].Equals(default(T)))
+            while (!Equals(currentV, default(T)) && !Equals(parentMap[currentV],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
index b29d0736..4672e963 100644
--- 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 (!Equals(currentV,default(T)) && !parentMap[currentV].Equals(default(T)))
+            while (!Equals(currentV,default(T)) && !Equals(parentMap[currentV], default(T)))
             {
                 pathStack.Push(parentMap[currentV]);
                 currentV = parentMap[currentV];
diff --git a/README.md b/README.md
index d4084d66..716d310c 100644
--- a/README.md
+++ b/README.md
@@ -244,7 +244,7 @@ Note: On a decent desktop, in given implementations here for +ive random input i
 ## Distributed Systems
 
 - [X] Circular Queue (Ring Buffer) ([Implementation](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms/DistributedSystems/CircularQueue.cs) | [Tests](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms.Tests/DistributedSystems/CircularQueue_Tests.cs))
-- [X] Consistant Hash ([Implementation](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms/DistributedSystems/ConsistantHash.cs) | [Tests](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms.Tests/DistributedSystems/ConsistantHash_Tests.cs))
+- [X] Consistant Hash ([Implementation](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms/DistributedSystems/ConsistentHash.cs) | [Tests](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms.Tests/DistributedSystems/ConsistentHash_Tests.cs))
 - [X] LRU Cache ([Implementation](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms/DistributedSystems/LRUCache.cs) | [Tests](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms.Tests/DistributedSystems/LRUCache_Tests.cs))
 
 ## Numerical Methods