C# Algorithms alternatives and similar packages
Based on the "Algorithms and Data structures" category

Algorithmia
Algorithm and datastructure library for .NET 3.5 and up. Algorithmia contains sophisticated algorithms and datastructures like graphs, priority queues, command, undoredo and more.
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.
Do you think we are missing an alternative of C# Algorithms or a related project?
Popular Comparisons
README
oo  
/ OO
O  
\ OO
oo  
O o oo oo oo oOo oOo o o o o oo
/ \  o o o       \ / 
oo   oo   OOo   OO  \o/  oo
   o  o o  \       
o o Oo oo oo o \o oOo o o o o o oo
WHAT IS C# ALGORITHMS?
A plugandplay classlibrary project of standard Data Structures and Algorithms, written in C#. It contains 75+ Data Structures and Algorithms, designed as ObjectOriented isolated components. Even though this project started for educational purposes, the implemented Data Structures and Algorithms are standard, efficient, stable and tested.
BACK STORY
This project originally started out as an interview preparation project. However, after receiving a great amount of positive responses on reddit, and noticing excitement from a few GitHubers to contribute furthermore to it, the project took on a different meaning. So, I decided to keep maintaining it as a reference for data structures and algorithm implementations in C# as well as my own research sideproject under these topics.
DESCRIPTION
Solution Hierarchy:
This is a C#.NET solutionproject, and it contains three subprojects:
 [Algorithms](Algorithms): A class library project. Contains the Algorithms implementations
 [Data Structures](DataStructures): A class library project. Contains the Data Structures implementations
 [UnitTest](UnitTest): Unittesting project for the Algorithms and Data Structures
Requirements:
 .NET Core >= 2.0
 XUnit
A Note to Contributors:
If you wish to contribute to C# ALGORITHMS, then please make sure you check out the [Contribution Guidelines](.github/CONTRIBUTING.md) first.
DATA STRUCTURES
Linear:
 [Skip List](DataStructures/Lists/SkipList.cs)
 [Array List](DataStructures/Lists/ArrayList.cs)
 [Stack](DataStructures/Lists/Stack.cs)
 [Queue](DataStructures/Lists/Queue.cs)
 [SingleLinked List](DataStructures/Lists/SLinkedList.cs)
 [DoubleLinked List](DataStructures/Lists/DLinkedList.cs)
Circular:
 [Circular Buffer](DataStructures/Lists/CircularBuffer.cs)
Heaps:
 [BinaryMin Heap](DataStructures/Heaps/BinaryMinHeap.cs)
 [BinaryMax Heap](DataStructures/Heaps/BinaryMaxHeap.cs)
 [BinomialMin Heap](DataStructures/Heaps/BinomialMinHeap.cs)
Priority Queues:
 [MinPriority Queue](DataStructures/Heaps/MinPriorityQueue.cs)
 [Keyvalue Priority Queue](DataStructures/Heaps/KeyedPriorityQueue.cs)
Hashing Functions:
 [Prime Hashing Family](DataStructures/Hashing/PrimeHashingFamily.cs)
 [Universal Hashing Family](DataStructures/Hashing/UniversalHashingFamily.cs)
Hash Tables:
 [Chained Hash Table](DataStructures/Dictionaries/ChainedHashTable.cs)
 [Cuckoo Hash Table](DataStructures/Dictionaries/CuckooHashTable.cs)
 [OpenAddressing Hash Table](DataStructures/Dictionaries/OpenAddressingHashTable.cs)
Sorted Collections (Treebased):
 [Sorted List](DataStructures/SortedCollections/SortedList.cs)
 [Sorted Dictionary](DataStructures/SortedCollections/SortedDictionary.cs)
Trees:
 Basic Search Trees:
 [Binary Search Tree](DataStructures/Trees/BinarySearchTree.cs)
 [Map version](DataStructures/Trees/BinarySearchTreeMap.cs) (supports keyvalue pairing; nodes indexed by keys)
 [(Augmented) Binary Search Tree](DataStructures/Trees/AugmentedBinarySearchTree.cs)
 [Ternary Search Tree](DataStructures/Trees/TernarySearchTree.cs)
 [Binary Search Tree](DataStructures/Trees/BinarySearchTree.cs)
 SelfBalancing Trees:
 [AVL Tree](DataStructures/Trees/AVLTree.cs)
 [BTree](DataStructures/Trees/BTree.cs)
 [RedBlack Tree](DataStructures/Trees/RedBlackTree.cs)
 [Map version](DataStructures/Trees/RedBlackTreeMap.cs) (supports keyvalue pairing; nodes indexed by keys)
 Prefix Trees:
 [Trie](DataStructures/Trees/Trie.cs)
 [Trie Map](DataStructures/Trees/TrieMap.cs) (associative prefix tree; complete words are keys to records)
Graphs:
 Undirected Graphs:
 [Clique Graphs](DataStructures/Graphs/CliqueGraph.cs)
 [Undirected Sparse Graph](DataStructures/Graphs/UndirectedSparseGraph.cs)
 [Undirected Dense Graph](DataStructures/Graphs/UndirectedDenseGraph.cs)
 Undirected Weighted Graphs:
 [Undirected Weighted Sparse Graph](DataStructures/Graphs/UndirectedWeightedSparseGraph.cs)
 [Undirected Weighted Dense Graph](DataStructures/Graphs/UndirectedWeightedDenseGraph.cs)
 Directed Graphs:
 [Directed Sparse Graph](DataStructures/Graphs/DirectedSparseGraph.cs)
 [Directed Dense Graph](DataStructures/Graphs/DirectedDenseGraph.cs)
 Directed Weighted Graphs:
 [Directed Weighted Sparse Graph](DataStructures/Graphs/DirectedWeightedSparseGraph.cs)
 [Directed Weighted Dense Graph](DataStructures/Graphs/DirectedWeightedDenseGraph.cs)
ALGORITHMS
Sorting:
 [Bubble Sort](Algorithms/Sorting/BubbleSorter.cs)
 [Bucket Sort](Algorithms/Sorting/BucketSorter.cs)
 [BST Sort](Algorithms/Sorting/BinarySearchTreeSorter.cs)
 [Comb Sort](Algorithms/Sorting/CombSorter.cs)
 [Counting Sort](Algorithms/Sorting/CountingSorter.cs)
 [Cycle Sort](Algorithms/Sorting/CycleSorter.cs)
 [Gnome Sort](Algorithms/Sorting/GnomeSorter.cs)
 [Heap Sort](Algorithms/Sorting/HeapSorter.cs)
 [Insertion Sort](Algorithms/Sorting/InsertionSorter.cs)
 [LSD Radix Sort](Algorithms/Sorting/LSDRadixSorter.cs)
 [Merge Sort](Algorithms/Sorting/MergeSorter.cs)
 [Selection Sort](Algorithms/Sorting/SelectionSorter.cs)
 [Shell Sort](Algorithms/Sorting/ShellSorter.cs)
 [OddEven Sort](Algorithms/Sorting/OddEvenSorter.cs)
 [PigeonHole Sort](Algorithms/Sorting/PigeonHoleSorter.cs)
 [Quick Sort](Algorithms/Sorting/QuickSorter.cs)
Searching:
 [Binary Search](Algorithms/Search/BinarySearcher.cs)
Graphs:
 Graph Search:
 [DepthFirst Searcher](Algorithms/Graphs/DepthFirstSearcher.cs)
 [BreadthFirst Searcher](Algorithms/Graphs/BreadthFirstSearcher.cs)
 Shortest Paths:
 [BreadthFirst SPs](Algorithms/Graphs/BreadthFirstShortestPaths.cs)
 [BellmanFord SPs](Algorithms/Graphs/BellmanFordShortestPaths.cs)
 [Dijkstra SPs](Algorithms/Graphs/DijkstraShortestPaths.cs)
 [Dijkstra AllPairs SPs](Algorithms/Graphs/DijkstraAllPairsShortestPaths.cs)
 DFS Applications:
 [Cycles Detector](Algorithms/Graphs/CyclesDetector.cs)
 [Topological Sorter](Algorithms/Graphs/TopologicalSorter.cs)
 BFS Applications:
 [Connected Components](Algorithms/Graphs/ConnectedComponents.cs)
 [Bipartite Graphs Coloring](Algorithms/Graphs/BipartiteColoring.cs)
Trees:
 [Recursive Binary Tree Walker](Algorithms/Trees/BinaryTreeRecursiveWalker.cs)
 Methods: PrintAll, ForEach, Contains and BinarySearch. Traversal Modes: Preorder, Inorder & Postorder
Strings:
 [Permutations and Anagrams](Algorithms/Strings/Permutations.cs)
 [Edit Distance](Algorithms/Strings/EditDistance.cs)
 Uses a generic custom class for passing costs: [EditDistanceCostsMap<T>](Algorithms/Strings/EditDistanceCostsMap.cs)
Numeric:
 [Binomial Coefficients](Algorithms/Numeric/BinomialCoefficients.cs)
 [Catalan Numbers](Algorithms/Numeric/CatalanNumbers.cs)
 [Greatest Common Divisor](Algorithms/Numeric/GreatestCommonDivisor.cs)
Visualization:
 [Tree Drawer](DataStructures/Trees/TreeDrawer.cs)
CONTRIBUTORS
<! Made with contributorsimg. >
LICENSE
This project is licensed under the [MIT License](LICENSE).
*Note that all licence references and agreements mentioned in the C# Algorithms README section above
are relevant to that project's source code only.