175 packages tagged with “Algorithm”
Spatial Index data structure; used to make it easier to find data points on a two dimensional plane.
.NET library that provide mainly graphs structures and algorithms for C#. QuikGraph provides generic directed/undirected graph data structures and algorithms for .NET. It comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, etc... This package is a version of the original QuickGraph renamed QuikGraph and ported to .NET Core. It should be seen as an alternative to the old frozen QuickGraph from CodePlex but with fixes. It does not include every sub modules of the original library such as F# stuff, adapters, etc. This build is only the Core of QuikGraph taking advantage of .NET Core. Supported platforms: - .NET Standard 1.3+ - .NET Core 1.0+ - .NET Framework 3.5+ Supports Source Link
.NET library that provides a bridge from QuikGraph graphs structures to Graphviz and Dot language serialization. This package is the Graphviz subset of the original QuickGraph renamed QuikGraph and ported to .NET Core. Supported platforms: - .NET Standard 1.3+ - .NET Core 1.0+ - .NET Framework 3.5+ Supports Source Link
A suite of .NET non-cryptographic hash functions.
.NET library that provides serialization features related to QuikGraph data structures. This package is the serialization subset of the original QuickGraph renamed QuikGraph and ported to .NET Core. Supported platforms: - .NET Standard 1.3+ - .NET Core 1.0+ - .NET Framework 3.5+ Supports Source Link
Machine Learning library in .NET Core.
This is a C# port of the Perl CPAN Algorithm::CouponCode to generate and validate coupon codes or license keys.
Algorithm and data-structure library for .NET 4.5.2+ / Netstandard 2.0+. Algorithmia contains sophisticated algorithms and data-structures like graphs, priority queues, command, undo-redo and more. Algorithmia is one of the pillars of LLBLGen Pro and is used in production successfully since May 2010. Many of the classes and algorithms in Algorithmia contain references to papers and articles on Wikipedia or other websites where you can find additional information regarding the algorithm or data-structure implemented. The core design of Algorithmia is about making algorithms and data-structures which are known for many years available to the .NET developer in easy to use and properly documented classes and methods. No class or method implemented in Algorithmia re-implements a .NET BCL (base class library) class or method unless it was necessary to do so (e.g. the linked list in .NET is re-implemented as it doesn't have an O(1) concat operation, which is necessary for the Fibonacci heap).
Implementation of the Dbscan clustering algorithm
Implementation Hungarian Algorithm. The Travelling-salesman-problem.
Provides a .NET implementation to the diff algorithm (shortest edit script) described by Eugene Myers in "An O(ND) Difference Algorithm and Its Variations". Unlike some other implementations, this one can compare sequences of any object type, using the standard Equals method or a custom IEqualityComparer. This project uses Semantic Versioning (https://semver.org/).
GraphShape is a .NET graph layout framework based on Graph#. It contains several layout algorithms that allow various kind of layouts (FR, KK, ISOM, LinLog, Simple Tree, Circular, Sugiyama, Compound FDP, Random). It also provide overlap removal algorithms such as FSA (or One Way FSA) algorithms. Supported platforms: - .NET Standard 2.0+ - .NET Core 2.0+ - .NET Framework 3.5+ - .NET 5+ Supports Source Link
HDBSCAN is a clustering algorithm developed by Campello, Moulavi, and Sander. It extends DBSCAN by converting it into a hierarchical clustering algorithm, and then using a technique to extract a flat clustering based in the stability of clusters.
A simple to use Genetic Algorithm Framework for .Net. See the project page for details on how to use this package.
Super fast zero allocation MurmurHash3 implementation.
This is a C# implementation of the Metaphone3 phonetic algorithm by Lawrence Philips given here: https://searchcode.com/codesearch/raw/2366000/.
This is a maze generator created by Devedse. It can be used to create incredibly big mazes.
C#-only solver for the rectangular linear assignment problem, also known as the minimum weight full matching problem for bipartite graphs. Algorithms used include shortest augmenting path search and cost-scaling pseudoflow based assignment.
Top-quality toolkit of algorithms and data structures for .NET developers.
ToolGood.Algorithm支持四则运算、Excel函数，并支持自定义参数。使用Antlr4解析，函数更容易扩展。注：不兼容老版本，禁止时间加减，数字、时间互转
A sentiment analysis algorithm in C#.
Boilerplate code to connect RBush with Dbscan.
This is the official NuGet package of Astronomical Algorithms # (AASharp or AA#) AASharp is a C# port of PJ Naughter's static C++ library, AA+. Naughter's library implements the algorithms in Jean Meuss' book, "Astronomical Algorithms."
Parallel high performance cross-platform C#/.NET algorithms. 30+ algorithms with familiar interfaces and examples. Multi-core and data parallel (SIMD/SSE). Open source and free. See project Readme, blog, and videos...
.NET library that provides convenient graph helpers related to DataTable (and also serialization to Graphviz). This package is a subset related to DataTable of the original QuickGraph renamed QuikGraph and ported to .NET Core. Supported platforms: - .NET Standard 2.0+ - .NET Core 2.0+ - .NET Framework 3.5+ Supports Source Link
.NET library that provides a bridge from QuikGraph graphs to MSAGL library. This package is the MSAGL subset of the original QuickGraph renamed QuikGraph and ported to .NET Core. Supported platforms: - .NET Standard 2.0+ - .NET Core 2.0+ - .NET Framework 4.6.1+ Supports Source Link
Utility for working with intervals, such as time periods. The utility allows you to find intersections of periods, exclude periods, etc.
.NET library that provides some Petri Net facilities. It allows to construct Petri Net representation and run a simulation of it. This package is the Petri subset of the original QuickGraph renamed QuikGraph and ported to .NET Core. Supported platforms: - .NET Standard 1.3+ - .NET Core 1.0+ - .NET Framework 3.5+ Supports Source Link
LibOptimization is a numerical optimization library that simplifies optimization using C#, VisualBasic.Net and other .NET Framework languages. Implementing optimization algorithm are Steepest Descent Method, Newton Method, Nelder Mead Method (Original ver, Wikipedia ver) ,Hooke and Jeeves of Pattern Search (Direct Search), Real-coded Genetic Algorithm(BLX-alpha and JGG, UNDX and JGG Simplex and JGG, REX and JGG, PCX and G3), Particle Swarm Optimization(Basic PSO, LDIW-PSO, CDIW-PSO, CRIW-PSO, AIW-PSO), Differential Evolution(DE/rand/1/bin, DE/best/1/bin, DE/rand/2/bin, DE/best/2/bin, JADE), Cuckoo Search(Standard), FireFry, Simulated Annealing, Evolution Strategy((1+1)-ES) and Hill Climbing.