A Euler circuit exists if and only if if every vertex of the graph has an even ...
length
degree
diameter
2: TSP stands for ...
Travelling Salesman Problem
Travelling Statistic Procedure
Travelling Salesman Purpose
3: Which of the following would NOT be considered a definition of heuristic algorithm:
Based on or involving trial and error
Convincing without being rigorous.
Approximate guess not based on trial and error
4: The "nearest neighborhood" problem involves identifying the ....... lying nearer to the query point than to any other point in the set.
locus of points
vertex
algorithm
5: A Eulerian circuit is a graph cycle which uses each ....... exactly once.
Graph edge
Angle
Vertex
2007-05-16
03:46:20
·
7 answers
·
asked by
heather n
1
in
Food & Drink
➔ Beer, Wine & Spirits