\( \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.14 - Triangulated Surface Mesh Shortest Paths
CGAL::Surface_mesh_shortest_path< Traits, VIM, HIM, FIM, VPM >::Source_point_iterator Class Reference

#include <CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h>

Definition

template<class Traits, class VIM = Default, class HIM = Default, class FIM = Default, class VPM = Default>
class CGAL::Surface_mesh_shortest_path< Traits, VIM, HIM, FIM, VPM >::Source_point_iterator

A model of BidirectionalIterator to access the source points.

An iterator becomes invalid if:

Dereferencing this iterator yields a const Surface_mesh_shortest_path::Face_location&.

This iterator supports equality comparison operations.

Public Member Functions

 Source_point_iterator ()
 Default constructor
 
 Source_point_iterator (const Source_point_iterator &other)
 Copy constructor.