Listen "Edsger Dijkstra's Shortest Path Algorithm"
Episode Synopsis
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants
More episodes of the podcast Programmers
The Almost Correct System
25/01/2026
Java Memory Model (JMM)
22/01/2026
AWS Lambda Pricing
19/01/2026
Http 123
04/10/2025
🌐 Scrapingdog: Web Scraping
10/03/2025
🧊 BigData - Apache Iceberg and Streaming
09/03/2025
📊 RDS PostgreSQL vs Redshift
06/03/2025
📚 DevOps - Terraform Providers
25/02/2025
