CGAL users discussion list

[Andreas Fabri <>]

Qu Yang wrote:
> Hi all,
>
> I've been trying to convert a delaunay triangulation (DT) to a boost graph.
> I want to some operation, such as removing edges in the obtained graph.
>
> The provided example that uses a filtered graph only return a reference 
> to DT.
> How can I get a deep copy of the filered graph?
>
> Yang


Hi Yang,

Sorry for the late reply.   The idea of the boost::filtered_graph
is just to not physically remove vertices and edges, but to have
a function object which decides if one iterates over vertices and
edges or not.

If you really want a new graph, you should maybe have a look at
http://www.boost.org/doc/libs/1_37_0/libs/graph/doc/copy_graph.html

best regards,

andreas