Getting Started with Pathfinding using Dijkstras Algorithm @WorldOfZeroDevelopment
Getting Started with Pathfinding using Dijkstras Algorithm  @WorldOfZeroDevelopment
Uploaded June 2020 | Updated November 2026, 2 hours ago
Lets explore pathfinding by implementing Dijkstra's Algorithm. Dijkstra's Algorithm is a pathfinding algorithm that works by calculating the distance from any node in a graph to a target node. To find a path from any node in the graph to the target node you need to find the next adjacent node with the shortest remaining distance to the target. We'll be implementing this for a dynamic graph of bi-directional nodes, however this can be implemented in a similar fashion for other areas like a tile system from a strategy game.

Wikipedia goes deeper into Dijkstra's Algorithm implementation and includes visual examples and pseudo code: en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Recently I've been streaming some of my longer projects and playing games on Twitch. You can find my streams at: twitch.tv/worldofzerodev

Join the World of Zero Discord Server: discord.gg/hU5Kq2u
Getting Started with Pathfinding using Dijkstras AlgorithmLearning to Deserialize YAML in C# with YamlDotNETSpinning In Circles and Other Mischief - Building Asteroids VR - Day 2Tracking Rigidbody Velocity in Asteroids VRIntroducing Testing into our PlatformerThe Search for Objects - Unity Observer - Part 1Using Your Terminals Directory Stack to Work With Multiple DirectoriesUsing Polar Coordinates in Unity Shader GraphsLets Explore Implicit Usings in C# 10Building worldofzero.com - Improved Video DescriptionsRotation Math Tricks - Using Unitys Quaternion OperatorsMath in the Unity Inspector - Quick Tip
World of Zero |

Getting Started with Pathfinding using Dijkstra's Algorithm

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER