12 packages returned for Tags:"Dijkstra"

Graph processing library.

The core library for the pathfindax pathfinding framework

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

Plugin that makes it easier to use pathfindax with duality tilemaps

ADN.Graphs is a cross-platform open-source library which provides graphs utilities to .NET developers

Package Description

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

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

A simple graph alrorithm library.

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.

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