From 1e5b6a1344903bc80c9900a4349a3c13234e1102 Mon Sep 17 00:00:00 2001 From: justcoding121 Date: Mon, 22 Jan 2018 20:39:24 -0500 Subject: [PATCH 1/2] fix spelling --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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 From ef100d4ceee27886fc98f6eaac190271883f20e4 Mon Sep 17 00:00:00 2001 From: justcoding121 Date: Tue, 23 Jan 2018 18:51:21 -0500 Subject: [PATCH 2/2] issue #5 fix --- .../GraphAlgorithms/ShortestPath/Bellman-Ford.cs | 2 +- Advanced.Algorithms/GraphAlgorithms/ShortestPath/Dijikstra.cs | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) 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 tracePath(WeightedDiGraph 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 tracePath(WeightedDiGraph 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];