// Copyright (c) 2007 GeometryFactory (France). All rights reserved. // // This file is part of CGAL (www.cgal.org); you can redistribute it and/or // modify it under the terms of the GNU Lesser General Public License as // published by the Free Software Foundation; either version 3 of the License, // or (at your option) any later version. // // Licensees holding a valid commercial license may use this file in // accordance with the commercial license agreement provided with the software. // // This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE // WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. // // $URL$ // $Id$ // SPDX-License-Identifier: LGPL-3.0+ // // // Author(s) : Andreas Fabri #ifndef CGAL_BOOST_GRAPH_TRAITS_SEAM_MESH_H #define CGAL_BOOST_GRAPH_TRAITS_SEAM_MESH_H #include #include #include #include #include #include #include #include namespace CGAL { template class Seam_mesh; template class Seam_mesh_halfedge_descriptor; } // namespace CGAL // We specialize std::iterator_traits, as VC++ tries to instantiate std::next(T, std::iterator_traits) namespace std { template struct iterator_traits > { struct difference_type { }; struct value_type { }; struct pointer { }; struct reference { }; struct iterator_category { }; }; } // namespace std namespace boost { template struct graph_traits< CGAL::Seam_mesh > { private: typedef CGAL::Seam_mesh SM; struct SM_graph_traversal_category : public virtual boost::bidirectional_graph_tag, public virtual boost::vertex_list_graph_tag, public virtual boost::edge_list_graph_tag { }; public: // Graph typedef typename SM::vertex_descriptor vertex_descriptor; typedef typename SM::edge_descriptor edge_descriptor; /* typedef typename SM::Point vertex_property_type; */ typedef boost::undirected_tag directed_category; typedef boost::disallow_parallel_edge_tag edge_parallel_category; typedef SM_graph_traversal_category traversal_category; // IncidenceGraph typedef typename SM::degree_size_type degree_size_type; // HalfedgeGraph typedef typename SM::halfedge_descriptor halfedge_descriptor; // FaceGraph typedef typename SM::face_descriptor face_descriptor; // VertexListGraph typedef typename SM::vertex_iterator vertex_iterator; typedef typename SM::vertices_size_type vertices_size_type; // EdgeListGraph typedef typename SM::edge_iterator edge_iterator; typedef typename SM::edges_size_type edges_size_type; // HalfEdgeListGraph typedef typename SM::halfedge_iterator halfedge_iterator; typedef typename SM::halfedges_size_type halfedges_size_type; // FaceListGraph typedef typename SM::face_iterator face_iterator; typedef typename SM::faces_size_type faces_size_type; typedef CGAL::In_edge_iterator in_edge_iterator; typedef CGAL::Out_edge_iterator out_edge_iterator; // nulls static vertex_descriptor null_vertex() { return vertex_descriptor(); } static face_descriptor null_face() { return face_descriptor(); } static halfedge_descriptor null_halfedge() { return halfedge_descriptor(); } }; template struct graph_traits > : public graph_traits > { }; } // namespace boost namespace CGAL { template typename boost::graph_traits >::vertices_size_type num_vertices(const CGAL::Seam_mesh& sm) { return sm.num_vertices(); } template typename boost::graph_traits >::edges_size_type num_edges(const CGAL::Seam_mesh& sm) { return sm.num_edges(); } template typename boost::graph_traits >::degree_size_type degree(typename boost::graph_traits >::vertex_descriptor v, const CGAL::Seam_mesh& sm) { return sm.degree(v); } template typename boost::graph_traits >::degree_size_type out_degree(typename boost::graph_traits >::vertex_descriptor v, const CGAL::Seam_mesh& sm) { return sm.degree(v); } template typename boost::graph_traits >::degree_size_type in_degree(typename boost::graph_traits >::vertex_descriptor v, const CGAL::Seam_mesh& sm) { return sm.degree(v); } template typename boost::graph_traits >::vertex_descriptor source(typename boost::graph_traits >::edge_descriptor e, const CGAL::Seam_mesh& sm) { return sm.source(e); } template typename boost::graph_traits >::vertex_descriptor source(typename boost::graph_traits >::halfedge_descriptor h, const CGAL::Seam_mesh& sm) { return sm.source(h); } template typename boost::graph_traits >::vertex_descriptor target(typename boost::graph_traits >::edge_descriptor e, const CGAL::Seam_mesh& sm) { return sm.target(e); } template typename boost::graph_traits >::vertex_descriptor target(typename boost::graph_traits >::halfedge_descriptor h, const CGAL::Seam_mesh& sm) { return sm.target(h); } template Iterator_range >::vertex_iterator> vertices(const CGAL::Seam_mesh& sm) { return sm.vertices(); } template Iterator_range >::edge_iterator> edges(const CGAL::Seam_mesh& sm) { return sm.edges(); } #if 1 template Iterator_range >::in_edge_iterator> in_edges(typename boost::graph_traits >::vertex_descriptor v, const CGAL::Seam_mesh& sm) { typedef typename boost::graph_traits >::in_edge_iterator Iter; return make_range(Iter(halfedge(v,sm),sm), Iter(halfedge(v,sm),sm,1)); } template Iterator_range >::out_edge_iterator> out_edges(typename boost::graph_traits >::vertex_descriptor v, const CGAL::Seam_mesh& sm) { typedef typename boost::graph_traits >::out_edge_iterator Iter; return make_range(Iter(halfedge(v,sm),sm), Iter(halfedge(v,sm),sm,1)); } #endif template std::pair >::edge_descriptor, bool> edge(typename boost::graph_traits >::vertex_descriptor u, typename boost::graph_traits >::vertex_descriptor v, const CGAL::Seam_mesh& sm) { return sm.edge(u, v); } // // HalfedgeGraph // template CGAL::Seam_mesh_halfedge_descriptor next(const CGAL::Seam_mesh_halfedge_descriptor& h, const CGAL::Seam_mesh& sm) { return sm.next(h); } template CGAL::Seam_mesh_halfedge_descriptor prev(const CGAL::Seam_mesh_halfedge_descriptor& h, const CGAL::Seam_mesh& sm) { return sm.prev(h); } template typename boost::graph_traits >::halfedge_descriptor opposite(typename boost::graph_traits >::halfedge_descriptor h, const CGAL::Seam_mesh& sm) { return sm.opposite(h); } template typename boost::graph_traits >::edge_descriptor edge(typename boost::graph_traits >::halfedge_descriptor h, const CGAL::Seam_mesh& sm) { return sm.edge(h); } template typename boost::graph_traits >::halfedge_descriptor halfedge(typename boost::graph_traits >::edge_descriptor e, const CGAL::Seam_mesh& sm) { return sm.halfedge(e); } template typename boost::graph_traits >::halfedge_descriptor halfedge(typename boost::graph_traits >::vertex_descriptor v, const CGAL::Seam_mesh& sm) { return sm.halfedge(v); } template std::pair< typename boost::graph_traits >::halfedge_descriptor, bool> halfedge(typename boost::graph_traits >::vertex_descriptor u, typename boost::graph_traits >::vertex_descriptor v, const CGAL::Seam_mesh& sm) { return sm.halfedge(u, v); } // // HalfedgeListGraph // template Iterator_range >::halfedge_iterator> halfedges(const CGAL::Seam_mesh& sm) { return sm.halfedges(); } template typename boost::graph_traits >::halfedges_size_type num_halfedges(const CGAL::Seam_mesh& sm) { return sm.num_halfedges(); } // // FaceGraph // template typename boost::graph_traits >::halfedge_descriptor halfedge(typename boost::graph_traits >::face_descriptor f, const CGAL::Seam_mesh& sm) { return sm.halfedge(f); } template typename boost::graph_traits >::face_descriptor face(typename boost::graph_traits >::halfedge_descriptor h, const CGAL::Seam_mesh& sm) { return sm.face(h); } // // FaceListGraph // template typename boost::graph_traits >::faces_size_type num_faces(const CGAL::Seam_mesh& sm) { return sm.num_faces(); } template Iterator_range >::face_iterator> faces(const CGAL::Seam_mesh& sm) { return sm.faces(); } } // namespace CGAL #endif // CGAL_BOOST_GRAPH_TRAITS_SEAM_MESH_H