DSA For Non-Traditionals: 7 - Dijkstra’s algorithm

In the "DSA (Data Structures and Algorithms) for Non-Traditionals" series, I'll be going over algorithms that EVERY developer needs to be familiar with.

In this session, we'll be continuing with Graphs, why they're important, and we'll look specifically at weighted graphs and how to find the shortest path using the Dijkstra's algorithm. I'll also explain WHY you need to know it (PS It's not just theory).

Video key points:

• Recap of unweighted graphs
• Dijkstra's algorithm
• Dijkstra's algorithm
• 4 steps
• When to use Dijkstra's algorithm over Breadth-first search algorithm?
• Example in theory
• Example in code (Python)
• Real world use cases

Source code is available HERE.

Recording