S9:E8 - "In the end, the code you take is equal to the code you make"
Mar 25, 2020 - 00:26:17
Radio and PodcastLive Radio & PodcastsTechnology
S8:E6 - "Getting deeper into Dijkastra"
We continue our talk about Dijkstra's algorithm, which can be used to determine the shortest path from one node in a graph to every other node within the same graph data structure, provided that the nodes are reachable f...
About This Episode
S8:E6 - "Getting deeper into Dijkastra" is an episode from Base.cs Podcast by Base.cs Podcast. We continue our talk about Dijkstra's algorithm, which can be used to determine the shortest path from one node in a graph to every other node wi...
Podcast
This episode belongs to Base.cs Podcast.
Listen Online
Use the player on this page to stream the episode online.
Episode Details
Published Nov 20, 2019, 00:29:23 long, audio available.
Related Episodes
Continue listening to more episodes from Base.cs Podcast.
S9:E7 - "This way to translate is le-JIT"
Mar 18, 2020 - 00:21:57
S9:E6 - "Two translators, both alike in dignity"
Mar 11, 2020 - 00:19:51
S9:E5 - "Paring down our parse trees with AST"
Mar 4, 2020 - 00:18:36
S9:E4 - "Confused about compilers?"
Feb 26, 2020 - 00:22:53
S9:E3 - "Parsing out parse trees"
Feb 19, 2020 - 00:23:14
S9:E2 - "Speeding up our traveling salesperson"
Feb 12, 2020 - 00:21:38
S9:E1 - "Take a journey with the Traveling Salesman"
Feb 5, 2020 - 00:30:04