Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
12 Cards in this Set
- Front
- Back
|
algorithm |
step by step description of how to solve a problem |
|
|
Brute force method |
the method that solves the traveling salesman problem by doing all Hamiltonian circuits and then selecting the one with minimum cost. |
|
|
complete graph |
Graph where every pair of vertices is joined by an edge |
|
|
Greedy Algorithm |
when you solve a problem step by step and take the best or cheapest action. Not always the optimal solution |
|
|
Hamiltonian circuit |
Circuit that starts and ends at same vertex and only hits each vertex once. Can also start at any vertex. |
|
|
Heuristic Algorithm |
Solving an optimization problem fast but doesn't guarantee an optimal answer to the problem |
|
|
Kruskal's algorithm |
AT&T guy. Spanning trees. Can't form a circuit. |
|
|
Minimum cost Hamiltonain Circuit |
Graph with weighted edges and the sum of the edges of the circuit are as small as possible. |
|
|
Minimum cost spanning tree |
Spanning tree with weighted connected graph having the minimum cost. The cost of the tree is the sum of the weights on the edges of tree. |
|
|
Euler Circuit |
A circuit that touches each edge of the graph once and only once. |
|
|
Eulerizing |
Adding new edges to a connected graph so that a graph possesses a Euler circuit. |
|
|
Optimal Solution |
The best ranking solution in a problem that has various solutions. |
