DSA For Non-Traditionals: 6 - Graphs and the Breadth-first search 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 going over Graphs, and why they're important, and then we'll look at them in action with the Breadth-first search algorithm. I'll also explain WHY you need to know these (PS It's not just theory).

Video key points:

• What is a Graph?
• What is the Shortest-Path Problem?
• What is the Breadth-first search algorithm?
• How the algorithm works
• Queue vs Stack
• Transforming your Graph into Code
• Coding the Breadth-first search algorithm
• Real world use cases

Source code is available HERE.

Recording