Let's make some connections.
We went over some of the cool properties and algorithms involving graphs, talking about the Seven Bridges of Königsberg problem and Eulerian paths, Euler's formula for convex polyhedra, and several shortest path algorithms.
Recording: https://youtu.be/AxaSaGPpieI
Comments