Dijkstra C# for Unity

Questions & Answers
1

Heya,

Currently i’m working on an end of year project centered around Path Finders.

At the moment I have Navmesh and A* working and I just need Dijkstra so I can run a performance comparison. Unfortunately I haven’t been able to find an a working C# tutorial to do Dijkstra, instead I have a JavaScript version (which still has some errors).

After a discussion with my lecturer he said JS is slower than C# and I should try translating it. Thats proving to be quite hard so I came here to see if anyone has a Dijstra tutorial or guide to implement it into Unity C#.

Looking forward to the response.

2

Implement A* then remove the Heuristic - Because Dijkstra is A* with the Heuristic removed.

So you will be using something like the Manhattan or Euclidian approximation for ideal distance in A*. Whereas the Dijkstra path finding algorithm uses no such approximation.