- [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] 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!

- [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] 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))

<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 conceptual"></div>

<div class="inheritance">

<h3 id="classes">Classes

</h3>

<h4><a class="xref" href="Advanced.Algorithms.Compression.HuffmanCoding-1.html">HuffmanCoding&lt;T&gt;</a></h4>

</div>

<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>

<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>

<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 conceptual"></div>

<div class="inheritance">

<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 conceptual"></div>

<div class="inheritance">

<section><p>All pairs shortest path algorithm result object.</p>

<h4><a class="xref" href="Advanced.Algorithms.Graph.AStarShortestPath-2.html">AStarShortestPath&lt;T, W&gt;</a></h4>

<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>

<section><p>Find Toplogical order of a graph using Depth First Search.</p>

<h4><a class="xref" href="Advanced.Algorithms.Graph.DijikstraShortestPath-2.html">DijikstraShortestPath&lt;T, W&gt;</a></h4>

<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

<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.IDistanceCalculator-1.html" name="" title="IDistanceCalculator&lt;T&gt;">IDistanceCalculator&lt;T&gt;</a>

</li>