Decision Flashcards
1
Q
What is a Hamiltonian cycle?
A
A cycle that visits every vertex of the
graph
2
Q
What is an Eulerian cycle?
A
A cycle that travels along every edge of
the graph
3
Q
What is a tree?
A
A graph with no cycles
4
Q
What is the order of an algorithm?
A
Measure of its efficiency as a function of the size of the
problem.
5
Q
What is the float of an activity?
A
End time - start time - duration
