CAPD RedHom Library
|
#include <capd/complex/DiscreteVectorFieldBoostGraph.h>
Classes | |
struct | Edge |
struct | Vertex |
Public Types | |
typedef DiscreteVectorField::Complex | Complex |
typedef Complex::Id | Id |
typedef complex::ComplexTraits< Complex >::Cell | Cell |
typedef boost::any_range< Vertex, typename homAux::PureIteratorTraversal< typename boost::range_iterator< typename Complex::Iterators::AllCells >::type >::type, const Vertex, std::ptrdiff_t > | Vertices |
typedef boost::any_range< Edge, typename homAux::PureFilterIteratorTraversal< typename Complex::Iterators::BdCells >::type, const Edge, std::ptrdiff_t > | OutEdges |
typedef boost::any_range< Edge, typename homAux::PureFilterIteratorTraversal< typename Complex::Iterators::CbdCells >::type, const Edge, std::ptrdiff_t > | InEdges |
Public Member Functions | |
DiscreteVectorFieldBoostGraph (DiscreteVectorField &dvf) | |
size_t | size () const |
Complex & | complex () const |
DiscreteVectorField & | dvf () const |
bool | inMatching (const Edge &e) const |
Vertices | vertices () const |
OutEdges | outEdges (const Vertex &v) const |
InEdges | inEdges (const Vertex &v) const |
bool | isProcessed (const Vertex &v) const |
bool | isCritical (const Vertex &v) const |
bool | isKing (const Vertex &v) const |
bool | isQueen (const Vertex &v) const |
Vertex | matched (const Vertex &v) const |
template<typename Scalar > | |
Scalar | coincidence (const Edge &e) const |
Vertex | vertex (Id id) const |
typedef complex::ComplexTraits<Complex>::Cell capd::complex::DiscreteVectorFieldBoostGraph< DiscreteVectorField >::Cell |
typedef DiscreteVectorField::Complex capd::complex::DiscreteVectorFieldBoostGraph< DiscreteVectorField >::Complex |
typedef Complex::Id capd::complex::DiscreteVectorFieldBoostGraph< DiscreteVectorField >::Id |
typedef boost::any_range<Edge, typename homAux::PureFilterIteratorTraversal< typename Complex::Iterators::CbdCells>::type, const Edge, std::ptrdiff_t> capd::complex::DiscreteVectorFieldBoostGraph< DiscreteVectorField >::InEdges |
typedef boost::any_range<Edge, typename homAux::PureFilterIteratorTraversal< typename Complex::Iterators::BdCells>::type, const Edge, std::ptrdiff_t> capd::complex::DiscreteVectorFieldBoostGraph< DiscreteVectorField >::OutEdges |
typedef boost::any_range< Vertex, typename homAux::PureIteratorTraversal<typename boost::range_iterator< typename Complex::Iterators::AllCells>::type>::type, const Vertex, std::ptrdiff_t> capd::complex::DiscreteVectorFieldBoostGraph< DiscreteVectorField >::Vertices |
|
inlineexplicit |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |