1
Q
What is a greedy graph?
A
A graph that can find an approximate solution to problems
2
Q
How do greedy graphs work?
A
They make the best decision on the information that is immediate to them and don’t “look ahead”
3
Q
What graph theories must you know?
A
Dijkstras algorithm
Travelling saleperson
4
Q
Who made graph theory?
A
Leonard Euler
5
Q
W=How do you approach a Knapsack problem?
A
Work out the density of the items from value/weight
6
Q
What is the knapsack problem?
A
A class of problems known as NP-Complete problems
Foundations of Computing
flashcards
Decks in class (4)
# Cards
