\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.9.1 - CGAL and the Boost Graph Library
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::internal::Less_on_G_copy_vertex_descriptors< G_copy, Less_on_orig_vertex_descriptors > Class Template Reference

#include <CGAL/boost/graph/split_graph_into_polylines.h>

Public Types

typedef boost::graph_traits
< G_copy >::vertex_descriptor 
g_copy_vertex_descriptor
 
typedef boost::graph_traits
< G_copy >::out_edge_iterator 
g_copy_out_edge_iterator
 
typedef boost::graph_traits
< G_copy >::degree_size_type 
g_copy_degree_size_type
 

Public Member Functions

 Less_on_G_copy_vertex_descriptors (const G_copy &g_copy, const Less_on_orig_vertex_descriptors &less)
 
bool operator() (g_copy_vertex_descriptor v1, g_copy_vertex_descriptor v2) const
 

Member Function Documentation

template<typename G_copy , typename Less_on_orig_vertex_descriptors >
bool CGAL::internal::Less_on_G_copy_vertex_descriptors< G_copy, Less_on_orig_vertex_descriptors >::operator() ( g_copy_vertex_descriptor  v1,
g_copy_vertex_descriptor  v2 
) const
  • then compare an adjacent vertex: