68 packages returned for Tags:"algorithms"

A fast, extensible, multi-platform and multithreading C# Genetic Algorithm library that simplifies the development of applications using Genetic Algorithms (GAs).

A few fundamental algorithms implemented via C# using .NET Standard 2.0-compatible projects and language features.

A set of templates written for the GeneticSharp: console application, TSP console application and TSP Unity3d. * Install the templates with command: dotnet new -i GeneticSharp.Templates * Create new projects for GeneticCharp: * dotnet new GeneticSharpConsoleApp... More information

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... More information

A class library providing generic data structures and algorithms not implemented in the standard .NET framework.

SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman).

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.

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... More information

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.

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

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net

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... More information

Calculates the sunrise and sunset for a given date and location (using Geographic Coordinates). This library uses the method outlined NOAA Solar Calculations Day spreadsheet found at http://www.esrl.noaa.gov/gmd/grad/solcalc/calcdetails.html. Calculations are based on the book "Astronomical... More information

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.

Welcome to Academy Collections. Academy.Collections presents a new set of data structures offering a lot of new applications for storing data in memory performing optimized operations and guaranteeing Microsoft .NET features like serialization and data information when debugging.... More information

A library with data structures, various algorithms and numerous extension methods.

Data structures and algorithms

DlxLib is a C# class library that solves exact cover problems by implementing Donald E. Knuth's Algorithm X using the Dancing Links technique.

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.

QuickGraph provides generic directed/undirected graph data structures and algorithms for .Net, Silverlight, Windows Phone and Win 8. QuickGraph comes with algorithms such as depth first search, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning... More information