S10 EP 8
What you should look for in online coding courses
S10 EP 7
S10 EP 6
S10 EP 5
S10 EP 4
S10 EP 3
S10 EP 2
Join us for our topical coding conversations every Wednesday at 9PM EST.
How was coding this week? Share your goals and your wins every Sunday at 2PM EST.
Vaidehi Joshi co-host, developer, author
Saron Yitbarek co-host, developer, founder
"I will not repeat myself again." - Dynamic Programming
We use Dijkstra's algorithm to find the shortest path from one node to another in a complicated house-shaped graph. Also, Vaidehi sings us a song.
To get from one point to any other point in a graph, make Dijkstra your weapon of choice.
DAG-nabbit! Don't forget to check whether or not a graph is a directed acyclic graph.