Hamilton Circuit Review

In a Hamilton Circuit, we visit

• every edge

• every vertex

• every pumpkin patch

• every costume store

In a Euler Circuit, we visit

• every edge

• every vertex

• every pumpkin patch

• every costume store

In a Hamilton Circuit, the degree of each vertex must be at least

• 1

• 2

• 3

• 4

What is the ONLY method that guarantees the best route is found?

• Brute Force

• Nearest Neighbor

• Repetitive Nearest Neighbor

• Cheapest Link

If a complete graph has 4 vertices, what is the degree of each vertex?

• 3

• 5

• 6

• 24

If a complete graph has 4 vertices, how many edges does the graph have?

• 3

• 5

• 6

• 24

If a complete graph has 4 vertices, how many Hamilton Circuits does the graph have?

• 3

• 5

• 6

• 24