Dijkstra’s Algorithm – Knox Game Design, January 2022

Explanation of Dijkstra’s algorithm for finding the shortest path in a graph based on a selected starting node. Walkthrough of an example of the algorithm. Demo of implementation of Dijkstra’s algorithm in Unity and C#.

Download Slides as PDF

Dijkstra Demo in Unity (Unity WebGL)

Dijkstra Demo Source Code

Links and Notes

Knox Game Design
Knox Game Design
Dijkstra's Algorithm - Knox Game Design, January 2022
/