Episode 222: From Stepanov to Euler to Shawshank

In this episode, Conor and Ben chat with Tristan Brindle about graph algorithm resources, tropical semirings, Stepanov stories, FM2GP, EOP, and veer off into a chat about TV shows, movies and more! Link to Episode 222 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials ADSP: The Podcast: Twitter Conor Hoekstra: Twitter | BlueSky | Mastodon Ben Deane: Twitter | BlueSky About the Guest Tristan Brindle a freelance programmer and trainer based in London, mostly focussing on C++. He is a member of the UK national body (BSI) and ISO WG21. Occasionally I can be found at C++ conferences. He is also a director of C++ London Uni, a not-for-profit organisation offering free beginner programming classes in London and online. He has a few fun projects on GitHub that you can find out about here . Show Notes Date Generated: 2025-02-17 Date Released: 2025-02-21 Mazes for Programmers by Jamis Buck Maze Demo from C++Now 2019: Ben Deane “Identifying Monoids: Exploiting Compositional Structure in Code” A Very General Method of Computing Shortest Paths From Mathematics to Generic Programming Spoils of the Eqyptians All A9 Playlists Elements of Programming FM2GP Progr…