20 packages tagged with “dijkstra”
Graph processing library.
The core library for the pathfindax pathfinding framework
Plugin that makes it easier to use pathfindax with duality
Dijkstra’s Algorithm (a generalization of breadth-first search) in C#. Declare your own Nodes and Edges to define the graph and let the algorithm find the best path to the target Node.
Implementation of Dijkstra's algorithm with graph builder.
Plugin that makes it easier to use pathfindax with duality tilemaps
Graph search algorithms that work against any graph type implementing the interfaces defined in SCGraphTheory.Abstractions.
A simple graph algorithm library.
ADN.Graphs is a cross-platform open-source library which provides graphs utilities to .NET developers
This repository allows a user to pathfind using various algorithms using a graph data structure (called WaypointMap in the application, a node is called WaypointNode). Currently supports only Dijkstra algorithm (only relative posiitons, no absolute ones necessary for A*). https://www.nuget.org/packages/WaypointPathfinding/
FloodSpill is a fast multi-purpose flood-fill algorithm for C#. It lets you run a flood in two-dimensional space, configure it with your own conditions and callbacks and choose between FIFO, LIFO or priority-based order for processing positions. Includes possibility of performing scanline-fill for better performance.
An F# implementation of Dijkstras algorithm
Allows mapping types by automatically chaining maps together, eg: If you have maps for types A -> B and B -> C you can also map A -> C by chaining A -> B -> C, supports normal maps and asynchronous ones, also supports collections.
Package Description
A .NET package to calculate the shortest sea route between two points on Earth.
Street Graphs to create and manage graphs, calculate shortest path, calculate transit speed and more
AMath.Algorithms is a library from AMath (Advanced Math) library groups. It includes the fastest and most popular algorithms to find shortest route and etc.
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.
MoreStructures is a library of classical algorithms and data structures, written 100% in (safe, managed) C# 10, for .NET 6 and above. Data structures - Stacks, Queues, Priority Queues, Disjoint Sets, Trees, Graphs, Suffix Trees, Suffix Tries. Algorithms - Strings sorting and matching. Lists searching and sorting. Trees augmentation and visit. Graphs: visits, minimum spanning tree, shortest distance, shortest path, topological sorting, strongly connected components. Suffix Trees and Tries construction and matching.