Euclidean generator and tsp enhancements

[megyhazy]

Thoughts:

• Generates complete graph. Does this need to be in the prototype name?
• There is an example that prints graphs and executes an MST algorithm. Maybe unnecessarily complex and can be removed.
• This is the beginning of refactoring the TSP heuristics to be more modular and have re-usable components vs the way it is now. I intend to refactor metric_tsp and then add nearest_neighbor
• This is related to issue Euclidian Random Graphs Utilities #452

Addressed earlier comments:

1. Added test and example to Jamfiles
2. To euclidean_graph_generator.hpp: Added BOOST_CONCEPT_ASSERT((MutableGraphConcept < VertexListGraph >));
3. To euclidean_graph_generator.hpp: Removed unused type declarations, PointType / CoordType
4. To euclidean_graph_generator.hpp: Added assert to compare size of points and graph.