cleanup

Author: justcoding121

Advanced.Algorithms.Tests/Combinatorics/Subset_Tests.cs

@@ -16,16 +16,16 @@ public class Subset_Tests
         public void Subset_Smoke_Test()
         {
             var input = "".ToCharArray().ToList();
-            var combinations = Subset.Find<char>(input);
-            Assert.AreEqual(Math.Pow(2, input.Count), combinations.Count);
+            var subsets = Subset.Find<char>(input);
+            Assert.AreEqual(Math.Pow(2, input.Count), subsets.Count);
 
             input = "cookie".ToCharArray().ToList();
-            combinations = Subset.Find<char>(input);
-            Assert.AreEqual(Math.Pow(2, input.Count), combinations.Count);
+            subsets = Subset.Find<char>(input);
+            Assert.AreEqual(Math.Pow(2, input.Count), subsets.Count);
 
             input = "monster".ToCharArray().ToList();
-            combinations = Subset.Find<char>(input);
-            Assert.AreEqual(Math.Pow(2, input.Count), combinations.Count);
+            subsets = Subset.Find<char>(input);
+            Assert.AreEqual(Math.Pow(2, input.Count), subsets.Count);
         }
 
 

Advanced.Algorithms.Tests/Combinatorics/Variation_Tests.cs

@@ -23,16 +23,16 @@ public class Variation_Tests
         public void Variation_Without_Repetitions_Smoke_Test()
         {
             var input = "".ToCharArray().ToList();
-            var Variations = Variation.Find<char>(input, 2, false);
-            Assert.AreEqual(combination(input.Count, 2) * factorial(2), Variations.Count);
+            var variations = Variation.Find<char>(input, 2, false);
+            Assert.AreEqual(combination(input.Count, 2) * factorial(2), variations.Count);
 
             input = "cookie".ToCharArray().ToList();
-            Variations = Variation.Find<char>(input, 3, false);
-            Assert.AreEqual(combination(input.Count, 3) * factorial(3), Variations.Count);
+            variations = Variation.Find<char>(input, 3, false);
+            Assert.AreEqual(combination(input.Count, 3) * factorial(3), variations.Count);
 
             input = "monsters".ToCharArray().ToList();
-            Variations = Variation.Find<char>(input, 3, false);
-            Assert.AreEqual(combination(input.Count, 3) * factorial(3), Variations.Count);
+            variations = Variation.Find<char>(input, 3, false);
+            Assert.AreEqual(combination(input.Count, 3) * factorial(3), variations.Count);
         }
 
 

Advanced.Algorithms/Compression/HuffmanCoding.cs

@@ -20,7 +20,7 @@ public Dictionary<T, byte[]> Compress(T[] input)
         {
             var frequencies = computeFrequency(input);
 
-            var minHeap = new FibornacciMinHeap<FrequencyWrap>();
+            var minHeap = new BMinHeap<FrequencyWrap>();
 
             foreach (var frequency in frequencies)
             {

Advanced.Algorithms/GraphAlgorithms/MinimumSpanningTree/Prims.cs

@@ -25,7 +25,7 @@ public List<MSTEdge<T, W>>
 
             //gather all unique edges
             DFS(graph, graph.ReferenceVertex,
-                new FibornacciMinHeap<MSTEdge<T, W>>(),
+                new BMinHeap<MSTEdge<T, W>>(),
                 new HashSet<T>(),
                 edges);
 
@@ -43,7 +43,7 @@ public List<MSTEdge<T, W>>
         /// <param name="spanTreeEdges">result MST edges</param>
         private void DFS(WeightedGraph<T, W> graph,
             WeightedGraphVertex<T, W> currentVertex,
-           FibornacciMinHeap<MSTEdge<T, W>> spanTreeNeighbours,
+           BMinHeap<MSTEdge<T, W>> spanTreeNeighbours,
            HashSet<T> spanTreeVertices,
            List<MSTEdge<T, W>> spanTreeEdges)
         {

README.md

@@ -195,7 +195,7 @@ Note: It is observed that among the implementations here in practice, with the e
 ### Minimum Spanning Tree
 
 - [X] Kruskal's algorithm ([Implementation](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms/GraphAlgorithms/MinimumSpanningTree/Kruskals.cs) | [Tests](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms.Tests/GraphAlgorithms/MinimumSpanningTree/Kruskals_Test.cs)) using Merge Sort and Disjoint Set
-- [X] Prim's algorithm ([Implementation](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms/GraphAlgorithms/MinimumSpanningTree/Prims.cs) | [Tests](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms.Tests/GraphAlgorithms/MinimumSpanningTree/Prims_Test.cs)) using Fibornacci Heap
+- [X] Prim's algorithm ([Implementation](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms/GraphAlgorithms/MinimumSpanningTree/Prims.cs) | [Tests](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms.Tests/GraphAlgorithms/MinimumSpanningTree/Prims_Test.cs))
 
 ## String
 
@@ -209,7 +209,7 @@ Note: It is observed that among the implementations here in practice, with the e
 
 ## Compression
 
-- [X] Huffman Coding ([Implementation](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms/Compression/HuffmanCoding.cs) | [Tests](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms.Tests/Compression/HuffmanCoding_Tests.cs)) using Fibornacci Min Heap
+- [X] Huffman Coding ([Implementation](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms/Compression/HuffmanCoding.cs) | [Tests](https://github.com/justcoding121/Advanced-Algorithms/tree/develop/Advanced.Algorithms.Tests/Compression/HuffmanCoding_Tests.cs)) 
 
 ## Sorting and Searching