Dijkstra map for Godot

Dijkstra Map for Godot is a GDNative plugin that introduces a Dijkstra Map pathfinding node to the Godot game engine. It provides enhanced versatility over the built-in AStar pathfinding by pre-computing shortest paths across an entire graph from given origin points, enabling efficient lookups of path lengths and directions for any point. This is particularly valuable for game genres like tower defense, RTS, roguelikes, and turn-based games where pre-computed or AI-driven movement is essential.

Key Features

• Full Graph Pathfinding — Populates the entire graph with shortest paths from origin points, allowing cost and direction lookups for any node.
• Terrain-Based Movement — Supports terrain IDs and weights to model different unit movement costs (e.g., forests slow cavalry, roads only for wagons) without duplicating the graph.
• Performance Optimized — Written in Rust for performance comparable to C/C++, approximately 10-20x faster than GDScript.
• Flexible Recalculation — Offers flags for bidirectional control, cost limits, initial weights, and early termination to save CPU cycles.
• Grid Support — Includes methods to automatically add square and hexagonal grids, simplifying graph creation.
• C# Compatibility — Provides a C# wrapper for first-class development experience with strong typing and pre-configured NativeScript.

Philosophy

The project prioritizes versatility and performance, offering a Dijkstra Map implementation that is both flexible for complex game mechanics and efficient enough for real-time use, all while integrating seamlessly into the Godot workflow.