The famous mathematician Leonhard Euler posed the Königsberg Bridges Problem: Can you cross all seven bridges exactly once on a walk and then return to the starting point? This playful question has important applications in fields such as route planning. In this chapter the authors show how to determine whether an Eulerian circuit exists in a figure, and in so doing they show how to solve problems such as the well-known “House of Santa Claus” riddle.
KeywordsTravelling Salesman Problem Garbage Collection Garbage Collector Eulerian Circuit Node Junction
Unable to display preview. Download preview PDF.