songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Add convenience functions for iterating/circulating around a vertex

This commit is contained in:
Andreas Fabri 2014-05-28 12:12:22 +02:00
parent c753fc97ff
commit ae75e031c8
1 changed files with 17 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
BGL/include/CGAL/boost/graph/iterator.h
View File

@ -502,6 +502,7 @@ class Halfedge_around_source_circulator
#ifndef DOXYGEN_RUNNING #ifndef DOXYGEN_RUNNING
typedef boost::transform_iterator<internal::Opposite<Graph>, Halfedge_around_target_circulator<Graph> > Base; typedef boost::transform_iterator<internal::Opposite<Graph>, Halfedge_around_target_circulator<Graph> > Base;
typedef typename boost::graph_traits<Graph>::halfedge_descriptor halfedge_descriptor; typedef typename boost::graph_traits<Graph>::halfedge_descriptor halfedge_descriptor;
typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex_descriptor;
#endif #endif
public: public:
@ -518,6 +519,9 @@ public:
: Base(Halfedge_around_target_circulator<Graph>(hd,g), internal::Opposite<Graph>(g)) : Base(Halfedge_around_target_circulator<Graph>(hd,g), internal::Opposite<Graph>(g))
{} {}
Halfedge_around_source_circulator(vertex_descriptor vd, const Graph& g)
: Base(Halfedge_around_target_circulator<Graph>(halfedge(vd,g),g), internal::Opposite<Graph>(g))
{}
}; };
@ -606,6 +610,11 @@ public:
Halfedge_around_target_circulator(halfedge_descriptor pos, const Graph& g) Halfedge_around_target_circulator(halfedge_descriptor pos, const Graph& g)
: pos(pos), g(&g) : pos(pos), g(&g)
{} {}
Halfedge_around_target_circulator(vertex_descriptor vd, const Graph& g)
: pos(halfedge(vd,g)), g(&g)
{}
#ifndef DOXYGEN_RUNNING #ifndef DOXYGEN_RUNNING
reference operator * ( ) { return pos; } reference operator * ( ) { return pos; }
const value_type& operator * ( ) const { return pos; } const value_type& operator * ( ) const { return pos; }
@ -779,6 +788,10 @@ halfedges_around_source(typename boost::graph_traits<Graph>::halfedge_descriptor
return std::make_pair(I(h,g), I(h,g,1)); return std::make_pair(I(h,g), I(h,g,1));
} }
/**
* \ingroup PkgBGLIterators
* returns an iterator range over all halfedges with vertex `v` as source.
*/
template<typename Graph> template<typename Graph>
std::pair<Halfedge_around_source_iterator<Graph>,Halfedge_around_source_iterator<Graph> > std::pair<Halfedge_around_source_iterator<Graph>,Halfedge_around_source_iterator<Graph> >
halfedges_around_source(typename boost::graph_traits<Graph>::vertex_descriptor v, Graph& g) halfedges_around_source(typename boost::graph_traits<Graph>::vertex_descriptor v, Graph& g)
@ -798,6 +811,10 @@ halfedges_around_target(typename boost::graph_traits<Graph>::halfedge_descriptor
return std::make_pair(I(h,g), I(h,g,1)); return std::make_pair(I(h,g), I(h,g,1));
} }
/**
* \ingroup PkgBGLIterators
* returns an iterator range over all halfedges with vertex `v` as target.
*/
template<typename Graph> template<typename Graph>
std::pair<Halfedge_around_target_iterator<Graph>,Halfedge_around_target_iterator<Graph> > std::pair<Halfedge_around_target_iterator<Graph>,Halfedge_around_target_iterator<Graph> >
halfedges_around_target(typename boost::graph_traits<Graph>::vertex_descriptor v, Graph& g) halfedges_around_target(typename boost::graph_traits<Graph>::vertex_descriptor v, Graph& g)