0

I want to implement a slightly altered Christofides algorithm for undirected graphs, whose vertices are 2D points. Seems like I need CGAL only for triangulation, everything else is provided in boost. Am I wrong?

Is there a better way to copy a graph from Point_set_2 class into boost's adjacency_list (other than iterating over adjacency lists and adding edge for every neighbour)?

user1487325
  • 13
  • 3
  • I'm not sure how you're planning to find a maximum-weight general matching (Boost has maximum cardinality only). Unless you really, really need that a priori approximation guarantee of 3/2, I would suggest to you that there is probably a better choice of algorithm. – David Eisenstat Sep 19 '14 at 17:39
  • Sorry, should have mentioned it earlier. Instead of matching, I plan to create a path on odd-degree vertices of MST and add every other edge of it to MST. Then find Euler's path. – user1487325 Sep 19 '14 at 18:22
  • Your question is low on details, but does http://doc.cgal.org/latest/BGL/index.html contain anything relevant? – Marc Glisse Sep 19 '14 at 18:25
  • Well, have fun then. – David Eisenstat Sep 19 '14 at 20:58

0 Answers0