5. Begin at vertex B. Use the Method of Trees to find the 3 different Hamiltonian circuits on the graph
below. Find the minimum cost.
B
65
C
77
52
M
52
102
84
A
6. Apply the Nearest-Neighbor Algorithm to find a Hamiltonian circuit for the graph below. Begin at
vertex C. Find the cost.
A
78
83
111
B
93
109
C
97
D