week 15 ( Greedy algorithm etc)

Question 1

Any verties pwede mag start

Answer 1

Greedy Algorithm

Question 2

Pick the smallest line in the whole graph, but be careful not to:

-Form a complete loop early
-Make a dot have more than 2 lines

Answer 2

Edge-Picking Algorithm

Question 3

Visit every place once and return home

Answer 3

Hamiltonian Circuit

Question 4

In ________graphs, all edges have numbers

Answer 4

weighted

Question 5

In _________ you can start anywhere but always choose the smallest weight after or near the chosen dot you chosed. then returen to where you started

Answer 5

Greedy Algorithm