BPF - Best Path Finding Algorithms (Dijkstra, A*, Bellman-Ford)

Short Description:

Production-ready shortest path algorithms for Unreal Engine, fully exposed to

Blueprints and C++. Includes Dijkstra, A* (with Euclidean heuristic), and

Bellman-Ford (with negative cycle detection).

Description:

BPF provides three optimized weighted graph pathfinding algorithms as a lightweight code plugin:

- Dijkstra - Optimal shortest path for non-negative edge weights

- A* - Heuristic-guided search using node world positions for faster spatial pathfinding

- Bellman-Ford - Handles negative edge weights with automatic negative cycle detection

All algorithms are Blueprint-callable with built-in performance metrics (execution time, nodes visited, edges relaxed) for profiling and comparison.

Weighted graph construction is provided through simple Blueprint helper nodes.

Features:

- Full Blueprint and C++ API

- Memory-efficient adjacency list graph representation

- Pre-allocated containers with zero raw memory management

- Built-in execution profiling on every call

- Single codebase compatible with UE 4.26 through 5.7

Ideal for: AI navigation, vehicle routing, network optimization, strategy game mechanics, and educational projects.