Use the Greedy Algorithm and the weighted graph below to generate a Hamiltonian circuit starting from each vertex. Then compare the different circuits to find the one of smallest total weights.Start...

Use the Greedy Algorithm and the weighted graph below to generate a Hamiltonian circuit starting from each vertex. Then compare the different circuits to find the one of smallest total weights.Start at vertex B

.2.Use the edge –picking algorithm to find a Hamiltonian circuit in the graph found in number 1.How can we compare.