Merge branch 'master' into beta

Author: justcoding121

.build/build.ps1

@@ -109,7 +109,7 @@ Task Document -depends Build {
 		git config --global credential.helper store
 		Add-Content "$HOME\.git-credentials" "https://$($env:github_access_token):[email protected]`n"
 		git config --global user.email $env:github_email
-		git config --global user.name "buildbot121"
+		git config --global user.name "buildbot171"
 		git add . -A
 		git commit -m "API documentation update by build server"
 		git push origin master

README.md

@@ -1,6 +1,6 @@
 ### Note: 
 
-Please don't take effort to create pull requests for new algorithms/data structures. This is just a curiosity driven personal hobby and [was originally not intented to be a library](https://github.com/justcoding121/Advanced-Algorithms/issues/2). Feel free fork and modify to fit your need if that's what you are looking for. You can however open issues/fix bugs with pull requests here, I would be happy to take a look when I get time.
+Please don't take effort to create pull requests for new algorithms/data structures. This is just a curiosity-driven personal hobby and [was originally not intended to be a library](https://github.com/justcoding121/Advanced-Algorithms/issues/2). Feel free fork and modify to fit your need if that's what you are looking for. You can, however, open issues/fix bugs with pull requests here, I would be happy to take a look when I get time
 
 ## Advanced Algorithms
 
@@ -77,7 +77,7 @@ Supports
 - [X] Fibonacci heap ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/DataStructures/Heap/FibonacciHeap.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/DataStructures/Heap/FibonacciHeap_Tests.cs))
 - [X] Pairing heap ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/DataStructures/Heap/PairingHeap.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/DataStructures/Heap/PairingHeap_Tests.cs))
 
-Note: It is observed that among the implementations here in practice, with the exclusion of UpdateKey (decrement/increment) operation regular Binary Heap & d-ary Heap outperforms other in theory superiors. Likely because it don't have pointer juggling overhead and hey arrays are faster!
+Note: It is observed that among the implementations here, in practice, with the exclusion of UpdateKey (decrement/increment) operation, regular Binary Heap & d-ary Heap outperforms other in theory superiors. Likely because it doesn't have pointer juggling overhead and hey arrays are faster!
 
 ### Tree
 

appveyor.yml

@@ -40,7 +40,7 @@ test: on
 skip_tags: true
 
 skip_commits:
-  author: buildbot121
+  author: buildbot171
   files:
     - docs/*
     - README.md
@@ -58,11 +58,11 @@ artifacts:
 
 environment:
   github_access_token:
-    secure: BGdKiI7FwHGkFt+/OmgZDkE1hzLqLrTxcc9c+joVqGyO4LvesHb1sR6hzisVwVPm
+    secure: mZLeq0GTB9kb5b6+HnVpJB6hhiYMJIQ2+Zf/DwZ/LEIyxJaYB1nx36aGHXE9q1cN
   github_email:
-    secure: wvYod3JLufbIBkavRXlCP724wJkhqR2RRuLLaPnqfps=
+    secure: iBJZGqxyiHVNeYI0uIW+MdGd3I3pg8brJtETNRkKe/A=
   nuget_access_token:
-    secure: ZbRmjOcp+TDllRV1wxqLZjdRV7hld388rXlWVJuGGiQleomP9Ku+Nsy3a75E7/9k
+    secure: 65rklofkoUWJzPPja621kXlxrruHemmbREnIX7QgXK0cydW412yYMZJQsN42Js27
 deploy:
 - provider: GitHub
   auth_token: $(github_access_token)

src/Advanced.Algorithms/Binary/BaseConversion.cs

@@ -2,7 +2,7 @@
 using System.Text;
 
 namespace Advanced.Algorithms.Binary
-{ 
+{
     /// <summary>
     /// Base conversion implementation.
     /// </summary>

src/Advanced.Algorithms/Compression/HuffmanCoding.cs

@@ -1,6 +1,6 @@
-using System;
+using Advanced.Algorithms.DataStructures;
+using System;
 using System.Collections.Generic;
-using Advanced.Algorithms.DataStructures;
 
 namespace Advanced.Algorithms.Compression
 {
@@ -53,7 +53,7 @@ public Dictionary<T, byte[]> Compress(T[] input)
         /// </summary>  
         private void dfs(FrequencyWrap currentNode, List<byte> pathStack, Dictionary<T, byte[]> result)
         {
-            if(currentNode.IsLeaf)
+            if (currentNode.IsLeaf)
             {
                 result.Add(currentNode.Item, pathStack.ToArray());
                 return;
@@ -114,7 +114,7 @@ public FrequencyWrap(T item, int frequency)
 
             public int CompareTo(object obj)
             {
-                return Frequency.CompareTo(((FrequencyWrap) obj).Frequency);
+                return Frequency.CompareTo(((FrequencyWrap)obj).Frequency);
             }
         }
 

src/Advanced.Algorithms/DataStructures/Dictionary/Dictionary.cs

@@ -9,7 +9,7 @@ namespace Advanced.Algorithms.DataStructures.Foundation
     /// </summary>
     /// <typeparam name="K">The key datatype.</typeparam>
     /// <typeparam name="V">The value datatype.</typeparam>
-    public class Dictionary<K, V> : IEnumerable<KeyValuePair<K, V>> 
+    public class Dictionary<K, V> : IEnumerable<KeyValuePair<K, V>>
     {
         private readonly IDictionary<K, V> dictionary;
 

src/Advanced.Algorithms/DataStructures/Dictionary/OpenAddressDictionary.cs

@@ -4,7 +4,7 @@
 
 namespace Advanced.Algorithms.DataStructures.Foundation
 {
-    internal class OpenAddressDictionary<TK, TV> : IDictionary<TK, TV> 
+    internal class OpenAddressDictionary<TK, TV> : IDictionary<TK, TV>
     {
         private DictionaryKeyValuePair<TK, TV>[] hashArray;
         private int bucketSize => hashArray.Length;
@@ -368,7 +368,7 @@ internal DictionaryKeyValuePair(K key, V value)
         }
     }
 
-    internal class OpenAddressDictionaryEnumerator<TK, TV> : IEnumerator<KeyValuePair<TK, TV>> 
+    internal class OpenAddressDictionaryEnumerator<TK, TV> : IEnumerator<KeyValuePair<TK, TV>>
     {
         internal DictionaryKeyValuePair<TK, TV>[] HashArray;
 

src/Advanced.Algorithms/DataStructures/Dictionary/SeparateChainingDictionary.cs

@@ -4,7 +4,7 @@
 
 namespace Advanced.Algorithms.DataStructures.Foundation
 {
-    internal class SeparateChainingDictionary<K, V> : IDictionary<K, V>  
+    internal class SeparateChainingDictionary<K, V> : IDictionary<K, V>
     {
         private const double tolerance = 0.1;
 
@@ -15,7 +15,7 @@ internal class SeparateChainingDictionary<K, V> : IDictionary<K, V>
 
         public int Count { get; private set; }
 
-       
+
         public SeparateChainingDictionary(int initialBucketSize = 3)
         {
             this.initialBucketSize = initialBucketSize;
@@ -301,7 +301,7 @@ public IEnumerator<KeyValuePair<K, V>> GetEnumerator()
 
     }
 
-    internal class SeparateChainingDictionaryEnumerator<TK, TV> : IEnumerator<KeyValuePair<TK, TV>> 
+    internal class SeparateChainingDictionaryEnumerator<TK, TV> : IEnumerator<KeyValuePair<TK, TV>>
     {
         internal DoublyLinkedList<KeyValuePair<TK, TV>>[] HashList;
 

src/Advanced.Algorithms/DataStructures/Graph/AdjacencyMatrix/WeightedGraph.cs

@@ -22,7 +22,7 @@ public class WeightedGraph<T, TW> : IGraph<T>, IEnumerable<T> where TW : ICompar
         private Dictionary<T, WeightedGraphVertex<T, TW>> vertexObjects;
 
         public int VerticesCount => usedSize;
-        public bool IsWeightedGraph => true; 
+        public bool IsWeightedGraph => true;
 
         public WeightedGraph()
         {
@@ -203,7 +203,7 @@ public bool HasEdge(T source, T dest)
             return false;
         }
 
-        public IEnumerable<KeyValuePair<T,TW>> Edges(T vertex)
+        public IEnumerable<KeyValuePair<T, TW>> Edges(T vertex)
         {
             if (!vertexIndices.ContainsKey(vertex))
             {
@@ -214,7 +214,7 @@ public IEnumerable<KeyValuePair<T,TW>> Edges(T vertex)
 
             for (int i = 0; i < maxSize; i++)
             {
-                if (!matrix[i,index].Equals(default(TW)))
+                if (!matrix[i, index].Equals(default(TW)))
                 {
                     yield return new KeyValuePair<T, TW>(reverseVertexIndices[i], matrix[i, index]);
                 }
@@ -302,7 +302,7 @@ private void halfMatrixSize()
             {
                 for (int j = i; j < maxSize; j++)
                 {
-                    if (!matrix[i, j].Equals(default(TW)) && !matrix[j,i].Equals(default(TW))
+                    if (!matrix[i, j].Equals(default(TW)) && !matrix[j, i].Equals(default(TW))
                         && reverseVertexIndices.ContainsKey(i)
                         && reverseVertexIndices.ContainsKey(j))
                     {
@@ -320,7 +320,7 @@ private void halfMatrixSize()
             reverseVertexIndices = newReverseIndices;
         }
 
-        public IEnumerable<IGraphVertex<T>> VerticesAsEnumberable => vertexObjects.Select(x=>x.Value);
+        public IEnumerable<IGraphVertex<T>> VerticesAsEnumberable => vertexObjects.Select(x => x.Value);
 
         IEnumerator IEnumerable.GetEnumerator()
         {

src/Advanced.Algorithms/DataStructures/Graph/IDiGraph.cs

@@ -7,7 +7,7 @@ namespace Advanced.Algorithms.DataStructures.Graph
     /// Directed graph. 
     /// </summary>
     /// <typeparam name="T"></typeparam>
-    public interface IDiGraph<T> 
+    public interface IDiGraph<T>
     {
         bool IsWeightedGraph { get; }
 
@@ -19,7 +19,7 @@ public interface IDiGraph<T>
 
         bool HasEdge(T source, T destination);
 
-        IDiGraph<T> Clone();      
+        IDiGraph<T> Clone();
     }
 
     public interface IDiGraphVertex<T>