CGAL users discussion list

[Song Lin <>]

Hi,

I want to find connected groups of an alpha_shape_3 and I'm trying to
use this function: (my thought was first find the neighbors of a vertex
and then check if one neighbor vertex was linked by an edge to that
vertex)

template <class OutputIterator>  OutputIterator
t.finite_adjacent_vertices ( Vertex_handle v, OutputIterator vertices)
Copies the Vertex_handles of all finite vertices adjacent to v to the
output iterator vertices. If t.dimension() <0, then do nothing. Returns
the resulting output iterator. 
Precondition: 
v ≠ Vertex_handle(), t.is_vertex(v).

But I don't know how to define an "OutputIterator vertices" type.(Sorry
if noob) And I can't find an example of this function. Can anyone give
me an example on how to use this function?

By the way, what does "v ≠ Vertex_handle()" mean? 


Best regards,
Lin
-- 
Center of Computational and Systems Biology, 
Institute of Biophysics, CAS.
15 Datun Road, Chaoyang District
Beijing, 100101
P.R.China