Eulerian Memes

That innocent Halloween question just activated every graph theorist's final form. While kids just want candy, mathematicians are mentally calculating whether visiting every house exactly once (Hamiltonian path) or crossing every street exactly once (Eulerian path) would maximize the candy-to-walking ratio. Nothing brings out a mathematician's superpower complex like an optimization problem disguised as childhood fun. The neighborhood just became a vertices and edges nightmare, and that poor kid is about to receive a lecture on NP-completeness instead of directions to the house with full-sized Snickers.