week 15 ( Greedy algorithm etc) Flashcards
(5 cards)
1
Q
Any verties pwede mag start
A
Greedy Algorithm
2
Q
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
A
Edge-Picking Algorithm
3
Q
Visit every place once and return home
A
Hamiltonian Circuit
4
Q
In ________graphs, all edges have numbers
A
weighted
5
Q
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
A
Greedy Algorithm
