TheHappieCat's video: How to Do PATHFINDING: Dijkstra s Algorithm

Today's video is on using Dijkstra's algorithm to find a shortest path when edges have different weights. We'll use this as a bridge to look at the A* algorithm in the next video, a similar but better performing technique. The A* video will be out later this week! And then something a bit different for next week / first week of June. Look at the project on Github: https://github.com/anneomcl/PathfindingBasics Check out my Patreon, all funds go directly back to the show: https://www.patreon.com/thehappiecat Find challenges and ask questions here: https://www.reddit.com/r/TheHappieMakers/ My second channel! https://www.youtube.com/c/TheHappierCat2 Follow me on Twitter: https://twitter.com/TheHappieCat Or Facebook: https://www.facebook.com/TheHappieCat/ Or Twitch: twitch.tv/happiecat