2. A path that uses every vertex of the graph exactly once.
Hamiltonian Path
A path that uses every vertex of the graph exactly once.

3. Hamiltonian Circuit
A path that begins and ends at the same vertex and uses every vertex of the graph once.

4. Which graphs have Hamiltonian circuits?

5. Which graphs have Hamiltonian circuits?

9. Sorted Edges Algorithm
Sort the edges from lowest to highest.
Add edges to your circuit, one at a time, in order of increasing cost.
Skip edges that would cause you to have 3 edges at one single vertex or close the circuit without all the vertices.

11. First, sort the edges from lowest to highest

12. Then, add edges one at a time starting from the lowest.

13. Then, add edges one at a time starting from the lowest.

25. Nearest Neighbor Algorithm
Start at a vertex
Travel to a vertex that you haven’t been to yet that has the smallest weight.
Continue until you have travelled to all vertices.
Travel back to your starting vertex.

32. Compare and contrast Euler circuits and Hamiltonian circuits
Compare and contrast Euler circuits and Hamiltonian circuits. Include an example of both. (At least 2 COMPLETE sentences)