Following a major storm, an inspector must walk down every street in a region to check for damaged power lines. Suppose the inspector's region can be modeled with the following graph. Vertices represent intersections, and edges represent streets. The numbers on the edges are called edge weights; they represent the distance the inspector must travel to inspect the corresponding street. How can the inspector check all the streets in a way that minimizes the total distance traveled? This has something to do with the Seven Bridges of Königsberg.