Episode 220: Graph Algorithms & 7 Bridges of Königsberg
Feb 07, 2025•34 min
Listen to this episode in Metacast mobile app
Don't just listen to podcasts. Learn from them with transcripts, summaries, and chapters for every episode. Skim, search, and bookmark insights. Learn more
Episode description
In this episode, Conor and Bryce chat about graph algorithms, the 7 bridges of Königsberg, Hamiltonian paths, Eulerian paths, and more!
Socials
- ADSP: The Podcast: Twitter
- Conor Hoekstra: Twitter | BlueSky | Mastodon
- Bryce Adelstein Lelbach
Show Notes
Date Generated: 2025-01-22
Date Released: 2025-02-07
- Algorithms by Panos Louridas
- ICPC
- 7 Bridges of Königsberg
- Hamiltonian Path
- Eulerian Path
- Elements of Programming
- C++20 std::ranges::transform
- Haskell iterate
- C++20 std::views::iota
- From Mathematics to Generic Programming (FM2GP)
- PLVM Meetup
Intro Song Info
Miss You by Sarah Jansen https://soundcloud.com/sarahjansenmusic
Creative Commons — Attribution 3.0 Unported — CC BY 3.0
Free Download / Stream: http://bit.ly/l-miss-you
Music promoted by Audio Library https://youtu.be/iYYxnasvfx8
For the best experience, listen in Metacast app for iOS or Android