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 fast, extensible, multi-platform and multithreading C# Genetic Algorithm library that simplifies the development of applications using Genetic Algorithms (GAs).
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.
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
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
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,...
More information
.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
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...
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.
.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
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 Standard 2.0
QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path,
k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc...
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...
More information