Graph Adaptors

Graph adaptors are classes that build an interface over an existing graph to provide new functionalities. For example, CGAL::Dual allows to traverse and query the dual graph of a graph without actually building the dual. By operating almost entirely on the input graph, adaptors can avoid potentially expensive operations, both in term of time and memory.

Classes
struct	CGAL::Graph_with_descriptor_with_graph< Graph_ >
struct	CGAL::Graph_with_descriptor_with_graph_property_map< Graph, PM, Category >
struct	CGAL::Face_filtered_graph< Graph, FIMap, VIMap, HIMap >
class	CGAL::Dual< Primal_ >
class	CGAL::Seam_mesh< TM, SEM, SVM >