S9 EP 8
Why you should read the new edition of the Pragmatic Programmer
S9 EP 7
S9 EP 6
S9 EP 5
S9 EP 4
S9 EP 3
S9 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
Take a deep breath as we dive into breadth-first search, a super nifty graph traversing algorithm, which gives the shortest way to get from one node to another.
Adjacency lists are the new type of hybrid you're going to want to be driving around your code.
We tackle representing graphs and the parts that make it up.
You won't want to miss the buzz about b-trees, the general version of a 2-3 tree, and a super efficient data storing tree structure.