Math help please?!
Math help please?
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
Answers:
Ok---I'll sure give it a shot!
1.Degree
2.No earthly idea
3.approximate guess not based on trial and error
4. I think that it is locus of points..see this website http://www.cs.sunysb.edu/~algorith/files...
5.Graph Edge
I checked Wikipedia for my answers....Good Luck!!
I dont no
The answer is:
D. Put your work down and have a beer.
I would not trust answers for your homework from here
You might want to re-ask this in the homework help section. I doubt that you will get any serious answers here.
You should probably stop reading about beer, wine and spirits while doing your homework. Also, I find that using the textbook yields better answers than Yahoo.