|
CGAL 6.0 - Triangulated Surface Mesh Shortest Paths
|
#include <CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h>
A model of BidirectionalIterator to access the source points.
An iterator becomes invalid if:
Surface_mesh_shortest_path::remove_source_point() or Surface_mesh_shortest_path::remove_all_source_points()).Surface_mesh_shortest_path::build_sequence_tree()).Surface_mesh_shortest_path::clear()).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. | |