Skip to content

README.md

Latest commit

 

History

History
35 lines (29 loc) · 1.43 KB

README.md

File metadata and controls

35 lines (29 loc) · 1.43 KB

Distance Map Path Finding

A lightweight pathfinding library based on Dijkstra’s algorithm, designed for flexibility and seamless integration with Unity.

image

Overview

Distance Map Path Finding provides utilities for generating distance maps and calculating paths using Dijkstra’s algorithm.
It supports both generic graph structures and Unity’s built-in Grid system, allowing you to use the same core logic across different use cases.
By simply implementing a custom ICostMap, you can extend the system to work with any graph or data structure.

Features

  • Generate distance maps using Dijkstra’s algorithm
  • Compute shortest paths efficiently
  • Built-in support for UnityEngine.Grid
  • Extensible to arbitrary graphs via ICostMap

Included Classes

Core

  • DijkstraDistanceMap
  • PathFinder

Grid Support

  • GridCostMap
  • GridDijkstraDistanceMap
  • GridPathFinder

Install with UPM

https://github.com/eviltwo/DistanceMapPathFinding.git?path=Assets/DistanceMapPathFinding

Support My Work

As a solo developer, your financial support would be greatly appreciated and helps me continue working on this project.