Algorithm visualisation
Dijkstra Algorithm Unity
Shortest-path finding, visualised in Unity 3D.
Overview
An implementation of Dijkstra's algorithm in Unity 3D, written in C#. Nodes are laid out in a scene, and the algorithm works out the shortest route between any two of them.
Nodes can be blocked to act as obstacles, and the path updates to avoid them. Selection works like a strategy game: drag the mouse to select several nodes at once.
Highlights
- Finds the shortest path from A to B
- Routes around blocked nodes
- RTS-style drag selection for choosing multiple nodes