Puzzle: Draw a house with five rooms. Is it possible to draw a path that crosses each wall exactly once?
Answer: No, it is not possible. This is another Eulerian path problem where the degree of each vertex makes such a path impossible.
Puzzle: Draw a house with five rooms. Is it possible to draw a path that crosses each wall exactly once?
Answer: No, it is not possible. This is another Eulerian path problem where the degree of each vertex makes such a path impossible.