Episode 220: Graph Algorithms & 7 Bridges of Königsberg
34:08 Share

In this episode, Conor and Bryce chat about graph algorithms, the 7 bridges of Königsberg, Hamiltonian paths, Eulerian paths, and more!

• Link to Episode 220 on Website
• Discuss this episode, leave a comment, or ask a question (on GitHub)

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