Re: [Boost-users] put problem 2 whit graph

On Feb 7, 2008 4:17 AM, BomBielFil wrote:

Hi Aaron, thank for your reply I use boost whit CGAL library and in the first line of my code I've a template "Is_finite":

typedef CGAL::Exact_predicates_inexact_constructions_kernel K; typedef CGAL::Arr_segment_traits_2<K> Segment_traits_2; typedef CGAL::Arr_polyline_traits_2 Traits_2; typedef K::Point_2 Point; typedef K::Segment_2 Segment; typedef Traits_2::Curve_2 Polyline;

typedef CGAL::Triangulation_vertex_base_with_id_2<K> Tvb; typedef CGAL::Triangulation_face_base_2<K> Tfb; typedef CGAL::Triangulation_data_structure_2 Tds; typedef CGAL::Delaunay_triangulation_2 Triangulation;

// consider finite vertices and edges.

template <typename T> struct Is_finite {

const T* t_;

Is_finite() : t_(NULL) {}

Is_finite(const T& t) : t_(&t) { }

template <typename VertexOrEdge> bool operator()(const VertexOrEdge& voe) const { return ! t_->is_infinite(voe); } };

Hi, You should direct your question to CGAL support - the code you've written for accessing/getting from/putting to property maps is fine, and should work with, say, a boost::adjacency_list. So it looks to me like a problem with the way CGAL is implementing property maps or the way you're using CGAL's property maps. Regards, Aaron