Loading...
Searching...
No Matches
Skeleton_blockers_edges_iterators.h
/* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
* See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
* Author(s): David Salinas
*
* Copyright (C) 2014 Inria
*
* Modification(s):
* - YYYY/MM Author: Description of the modification
*/
#ifndef SKELETON_BLOCKER_ITERATORS_SKELETON_BLOCKERS_EDGES_ITERATORS_H_
#define SKELETON_BLOCKER_ITERATORS_SKELETON_BLOCKERS_EDGES_ITERATORS_H_
#include <boost/iterator/iterator_facade.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <utility> // for pair<>
namespace Gudhi {
namespace skeleton_blocker {
template<typename SkeletonBlockerComplex>
class Edge_around_vertex_iterator : public boost::iterator_facade <Edge_around_vertex_iterator<SkeletonBlockerComplex>
, typename SkeletonBlockerComplex::Edge_handle const, boost::forward_traversal_tag
, typename SkeletonBlockerComplex::Edge_handle const> {
friend class boost::iterator_core_access;
typedef SkeletonBlockerComplex Complex;
typedef typename Complex::boost_adjacency_iterator boost_adjacency_iterator;
typedef typename Complex::Vertex_handle Vertex_handle;
typedef typename Complex::Edge_handle Edge_handle;
private:
const Complex* complex;
Vertex_handle v;
boost_adjacency_iterator current_;
boost_adjacency_iterator end_;
public:
Edge_around_vertex_iterator() : complex(NULL) { }
Edge_around_vertex_iterator(const Complex* complex_, Vertex_handle v_) :
complex(complex_),
v(v_) {
tie(current_, end_) = adjacent_vertices(v.vertex, complex->skeleton);
}
Edge_around_vertex_iterator(const Complex* complex_, Vertex_handle v_, int end) :
complex(complex_),
v(v_) {
tie(current_, end_) = adjacent_vertices(v.vertex, complex->skeleton);
set_end();
}
bool equal(const Edge_around_vertex_iterator& other) const {
return (complex == other.complex) && (v == other.v) && (current_ == other.current_) && (end_ == other.end_);
}
void increment() {
if (current_ != end_)
++current_;
}
Edge_handle dereference() const {
return *(*complex)[std::make_pair(v, static_cast<Vertex_handle> (*current_))];
}
private:
// remove this ugly hack
void set_end() {
current_ = end_;
}
};
template<typename SkeletonBlockerComplex>
class Edge_iterator : public boost::iterator_facade <Edge_iterator<SkeletonBlockerComplex>
, typename SkeletonBlockerComplex::Edge_handle const
, boost::forward_traversal_tag
, typename SkeletonBlockerComplex::Edge_handle const> {
friend class boost::iterator_core_access;
public:
typedef SkeletonBlockerComplex Complex;
typedef typename Complex::boost_edge_iterator boost_edge_iterator;
typedef typename Complex::Edge_handle Edge_handle;
const Complex* complex;
std::pair<boost_edge_iterator, boost_edge_iterator> edge_iterator;
Edge_iterator() : complex(NULL) { }
Edge_iterator(const SkeletonBlockerComplex* complex_) :
complex(complex_),
edge_iterator(boost::edges(complex_->skeleton)) { }
Edge_iterator(const SkeletonBlockerComplex* complex_, int end) :
complex(complex_),
edge_iterator(boost::edges(complex_->skeleton)) {
edge_iterator.first = edge_iterator.second;
}
bool equal(const Edge_iterator& other) const {
return (complex == other.complex) && (edge_iterator == other.edge_iterator);
}
void increment() {
if (edge_iterator.first != edge_iterator.second) {
++(edge_iterator.first);
}
}
Edge_handle dereference() const {
return (*(edge_iterator.first));
}
};
} // namespace skeleton_blocker
namespace skbl = skeleton_blocker;
} // namespace Gudhi
#endif // SKELETON_BLOCKER_ITERATORS_SKELETON_BLOCKERS_EDGES_ITERATORS_H_
Gudhi::skeleton_blocker::Edge_iterator
Iterator on the edges of a simplicial complex.
Definition Skeleton_blockers_edges_iterators.h:88
Gudhi::skeleton_blocker::Edge_iterator::Edge_iterator
Edge_iterator(const SkeletonBlockerComplex *complex_, int end)
Definition Skeleton_blockers_edges_iterators.h:108
Gudhi::skeleton_blocker::Skeleton_blocker_complex::Vertex_handle
SkeletonBlockerDS::Vertex_handle Vertex_handle
The type of an handle to a vertex of the complex.
Definition Skeleton_blocker_complex.h:77
Gudhi::skeleton_blocker::Skeleton_blocker_complex::Edge_handle
boost::graph_traits< Graph >::edge_descriptor Edge_handle
Handle to an edge of the complex.
Definition Skeleton_blocker_complex.h:114
Gudhi
Gudhi namespace.
Definition SimplicialComplexForAlpha.h:14