Best for asynchronous learning and homeworkAssign in student-paced mode
Best for live in-class or video conferencing lessonsStart teacher-led lesson
3 slides
Instructions:
Start at vertex A.
At each step, choose the edge with the smallest weight that leads to an unvisited vertex.
Do not revisit any vertex.
Continue this process until all vertices have been visited exactly once.
Finally, return to the starting vertex A to complete the Hamiltonian circuit.
List the order of vertices in the circuit and the total weight of the path.