Merge pull request #27 from justcoding121/master

Beta 0.0.410+

Author: justcoding121

README.md

@@ -74,7 +74,7 @@ Supports
 - [X] Binary heap ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/DataStructures/Heap/BHeap.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/DataStructures/Heap/BHeap_Tests.cs))
 - [X] d-ary heap ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/DataStructures/Heap/d-aryHeap.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/DataStructures/Heap/D-aryHeap_Tests.cs))
 - [X] Binomial heap ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/DataStructures/Heap/BinomialHeap.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/DataStructures/Heap/BinomialHeap_Tests.cs))
-- [X] Fibornacci heap ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/DataStructures/Heap/FibornacciHeap.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/DataStructures/Heap/FibornacciHeap_Tests.cs))
+- [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!
@@ -175,11 +175,11 @@ TODO: implement trie compression.
 #### Shortest path
 
 - [X] Bellman-Ford algorithm ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/Graph/ShortestPath/Bellman-Ford.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/Graph/ShortestPath/BellmanFord_Tests.cs))
-- [X] Dijikstra's algorithm ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/Graph/ShortestPath/Dijikstra.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/Graph/ShortestPath/Dijikstras_Tests.cs)) using Fibornacci heap.
+- [X] Dijikstra's algorithm ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/Graph/ShortestPath/Dijikstra.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/Graph/ShortestPath/Dijikstras_Tests.cs)) using Fibonacci heap.
 - [X] Floyd-Warshall algorithm ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/Graph/ShortestPath/Floyd-Warshall.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/Graph/ShortestPath/FloydWarshall_Tests.cs))
 - [X] Johnson's algorithm ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/Graph/ShortestPath/Johnsons.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/Graph/ShortestPath/Johnson_Tests.cs))
 - [X] Travelling salesman path ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/Graph/ShortestPath/TravellingSalesman.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/Graph/ShortestPath/TravellingSalesman_Tests.cs))
-- [X] A* search algorithm ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/Graph/ShortestPath/AStar.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/Graph/ShortestPath/AStar_Tests.cs)) using Fibornacci heap.
+- [X] A* search algorithm ([implementation](https://github.com/justcoding121/Advanced-Algorithms/blob/master/src/Advanced.Algorithms/Graph/ShortestPath/AStar.cs) | [tests](https://github.com/justcoding121/Advanced-Algorithms/blob/master/tests/Advanced.Algorithms.Tests/Graph/ShortestPath/AStar_Tests.cs)) using Fibonacci heap.
 
 #### Matching
 

docs/api/Advanced.Algorithms.Compression.HuffmanCoding-1.html

@@ -83,7 +83,7 @@
 
   <h1 id="Advanced_Algorithms_Compression_HuffmanCoding_1" data-uid="Advanced.Algorithms.Compression.HuffmanCoding`1" class="text-break">Class HuffmanCoding&lt;T&gt;
   </h1>
-  <div class="markdown level0 summary"><p>A huffman coding implementation using Fibornacci Min Heap.</p>
+  <div class="markdown level0 summary"><p>A huffman coding implementation using Fibonacci Min Heap.</p>
 </div>
   <div class="markdown level0 conceptual"></div>
   <div class="inheritance">

docs/api/Advanced.Algorithms.Compression.html

@@ -88,7 +88,7 @@ <h1 id="Advanced_Algorithms_Compression" data-uid="Advanced.Algorithms.Compressi
     <h3 id="classes">Classes
   </h3>
       <h4><a class="xref" href="Advanced.Algorithms.Compression.HuffmanCoding-1.html">HuffmanCoding&lt;T&gt;</a></h4>
-      <section><p>A huffman coding implementation using Fibornacci Min Heap.</p>
+      <section><p>A huffman coding implementation using Fibonacci Min Heap.</p>
 </section>
 </article>
           </div>

docs/api/Advanced.Algorithms.DataStructures.html

@@ -133,9 +133,6 @@ <h4><a class="xref" href="Advanced.Algorithms.DataStructures.DoublyLinkedListNod
 </section>
       <h4><a class="xref" href="Advanced.Algorithms.DataStructures.FenwickTree-1.html">FenwickTree&lt;T&gt;</a></h4>
       <section><p>A Fenwick Tree (binary indexed tree) implementation for prefix sum.</p>
-</section>
-      <h4><a class="xref" href="Advanced.Algorithms.DataStructures.FibornacciHeap-1.html">FibornacciHeap&lt;T&gt;</a></h4>
-      <section><p>A fibornacci minMax heap implementation.</p>
 </section>
       <h4><a class="xref" href="Advanced.Algorithms.DataStructures.IntervalTree-1.html">IntervalTree&lt;T&gt;</a></h4>
       <section><p>A multi-dimensional interval tree implementation.</p>

docs/api/Advanced.Algorithms.Graph.AStarShortestPath-2.html

@@ -83,7 +83,7 @@
 
   <h1 id="Advanced_Algorithms_Graph_AStarShortestPath_2" data-uid="Advanced.Algorithms.Graph.AStarShortestPath`2" class="text-break">Class AStarShortestPath&lt;T, W&gt;
   </h1>
-  <div class="markdown level0 summary"><p>A* algorithm implementation using Fibornacci Heap.</p>
+  <div class="markdown level0 summary"><p>A* algorithm implementation using Fibonacci Heap.</p>
 </div>
   <div class="markdown level0 conceptual"></div>
   <div class="inheritance">

docs/api/Advanced.Algorithms.Graph.DijikstraShortestPath-2.html

@@ -83,7 +83,7 @@
 
   <h1 id="Advanced_Algorithms_Graph_DijikstraShortestPath_2" data-uid="Advanced.Algorithms.Graph.DijikstraShortestPath`2" class="text-break">Class DijikstraShortestPath&lt;T, W&gt;
   </h1>
-  <div class="markdown level0 summary"><p>A dijikstra algorithm implementation using Fibornacci Heap.</p>
+  <div class="markdown level0 summary"><p>A dijikstra algorithm implementation using Fibonacci Heap.</p>
 </div>
   <div class="markdown level0 conceptual"></div>
   <div class="inheritance">

docs/api/Advanced.Algorithms.Graph.html

@@ -91,7 +91,7 @@ <h4><a class="xref" href="Advanced.Algorithms.Graph.AllPairShortestPathResult-2.
       <section><p>All pairs shortest path algorithm result object.</p>
 </section>
       <h4><a class="xref" href="Advanced.Algorithms.Graph.AStarShortestPath-2.html">AStarShortestPath&lt;T, W&gt;</a></h4>
-      <section><p>A* algorithm implementation using Fibornacci Heap.</p>
+      <section><p>A* algorithm implementation using Fibonacci Heap.</p>
 </section>
       <h4><a class="xref" href="Advanced.Algorithms.Graph.BellmanFordShortestPath-2.html">BellmanFordShortestPath&lt;T, W&gt;</a></h4>
       <section><p>A Bellman Ford algorithm implementation.</p>
@@ -118,7 +118,7 @@ <h4><a class="xref" href="Advanced.Algorithms.Graph.DepthFirstTopSort-1.html">De
       <section><p>Find Toplogical order of a graph using Depth First Search.</p>
 </section>
       <h4><a class="xref" href="Advanced.Algorithms.Graph.DijikstraShortestPath-2.html">DijikstraShortestPath&lt;T, W&gt;</a></h4>
-      <section><p>A dijikstra algorithm implementation using Fibornacci Heap.</p>
+      <section><p>A dijikstra algorithm implementation using Fibonacci Heap.</p>
 </section>
       <h4><a class="xref" href="Advanced.Algorithms.Graph.EdmondKarpMaxFlow-2.html">EdmondKarpMaxFlow&lt;T, W&gt;</a></h4>
       <section><p>An Edmond Karp max flow implementation on weighted directed graph using 

docs/api/toc.html

@@ -106,9 +106,6 @@
                           <li>
                               <a href="Advanced.Algorithms.DataStructures.FenwickTree-1.html" name="" title="FenwickTree&lt;T&gt;">FenwickTree&lt;T&gt;</a>
                           </li>
-                          <li>
-                              <a href="Advanced.Algorithms.DataStructures.FibornacciHeap-1.html" name="" title="FibornacciHeap&lt;T&gt;">FibornacciHeap&lt;T&gt;</a>
-                          </li>
                           <li>
                               <a href="Advanced.Algorithms.DataStructures.IDistanceCalculator-1.html" name="" title="IDistanceCalculator&lt;T&gt;">IDistanceCalculator&lt;T&gt;</a>
                           </li>