16 packages returned for Tags:"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.

Plugin that makes it easier to use pathfindax with duality tilemaps

Implementation of Dijkstra's algorithm with graph builder.

Graph search algorithms that work against any graph type implementing the interfaces defined in SCGraphTheory.Abstractions.

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

A simple graph alrorithm library.

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

An F# implementation of Dijkstras algorithm

Package Description

Street Graphs to create and manage graphs, calculate shortest path, calculate transit speed and more

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

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