In class, we started with the classic Königsberg problem of drawing a shape with 1 continuous line. The shape is made up of nods and lines connected to them, you could go over the nods multiple times but only once for the lines. We practiced numerous questions before explaining how to identify whether a shape is crossable or not. Lastly, we provided real-world problems that use the same application as the Königsberg problem. How do you go through all roads of a street in the fastest way? What additional roads do we need to add if the shape is not crossable?