Top 20 NuGet algorithms Packages

[Icon]
CodeJam is a set of handy reusable .NET components that can simplify your daily work and save your time when you copy and paste your favorite helper methods and classes from one project to another.
[Icon]
Contains chromosome and selection classes to create Genetic Algorithms (GA), Genetic Programming (GP) and Gene Expression Programming (GEP). This package originated from the AForge.NET Framework and is now part of the Accord.NET Framework.
[Icon]
.NET Implementation of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense.
[Icon]
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net, Silverlight, Windows Phone and Win 8. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning...
[Icon]
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net
[Icon]
SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman).
[Icon]
Implements image-processing and computer-vision algorithms. Provides extensions for image-processing algorithms implemented in Accord.NET framework and for some image-processing algorithms implemented in AForge.NET framework.
[Icon]
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .NET. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, etc...
[Icon]
Package provides C# implementation of algorithms in the "Algorithms" book (http://algs4.cs.princeton.edu/home/) and Robert Sedgwick's Algorithms course using Python (Part I and Part II), covering data structure, sorting, search, graph processing, string processing.
[Icon]
The AForge.Genetic library contains classes to run Genetic Algorithms (GA), Genetic Programming (GP) and Gene Expression Programming (GEP). Set of chromosome and selection classes are provided. Full list of features is available on the project's web site.
[Icon]
Correct QuickGraph version for projects such as GraphX that use cross-platform PCL libraries. QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net, Silverlight, Windows Phone and Win 8. QuickGraph comes with algorithms such as depth first seach, breath...
[Icon]
SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). Work provided by UK Sheffield University funded by (AKT) an IRC sponsored by EPSRC, grant number GR/N15764/01. http://www.dcs.shef.ac.uk/~sam/simmetrics.html
[Icon]
ImVader is a framework for working with graphs. It provides implementation of common graph algorithms: BFS, DFS, Dijkstra and Floyd-Worshell algorithms, topological sort, computing strong components, finding minimum cuts and others.
[Icon]
Aardvark.Base is a collection of data structures and algorithms for computer graphics and visualization. It is under active development since 2006 as part of a much larger set of libraries at VRVis Research Center.
[Icon]

Z

Data structures and algorithms
[Icon]
Inside Collections are found different data structures and algorithms, only a few of them are not completed and help will be well received.
[Icon]
DlxLib is a C# class library that solves exact cover problems by implementing Donald E. Knuth's Algorithm X using the Dancing Links technique.
[Icon]
The CodePlex Parallel STL project is the Microsoft prototype of the Working Draft, Technical Specification for C++ Extensions for Parallelism a proposal to add a set of high level parallel algorithms to the next major version of the ISO C++.
[Icon]
Consistent hashing for C#.
[Icon]
C# .NET 2.0 library of application-agnostic formulae, widgets, data structures, and algorithms