![]() |
CAPD RedHom Library
|
#include <capd/complex/FundamentalGroupPaths.h>
Public Types | |
| typedef DiscreteVectorField::Id | Id |
| typedef DiscreteVectorField::Complex | Complex |
| typedef std::vector< std::pair< Id, int > > | Chain |
| typedef std::pair< Id, int > | PathCell |
| typedef std::list< PathCell > | Path |
| typedef std::map< Id, Path > | PathsMap |
| typedef PathsMap::iterator | PathsMapIterator |
| typedef boost::bimap< Id, Id > | AcesMap |
Public Member Functions | |
| FundamentalGroupPaths (const DiscreteVectorField &dvf) | |
| Chain | GetHomotopicBoundary (const Id &cellId) |
| void | GetHomotopicPath (const Path &path, Path &outPath) |
| void | GetHomotopicPath (const PathCell &cell, Path &outPath) |
| PathsMapIterator | GetQueenHomotopicPath (Id cellId) |
| std::list< std::pair< Id, int > > | GetOrdered2Boundary (const Id &cellId) |
| void | ReverseNegate (const Path &path, Path &outPath) |
| void | Negate (Path &path) |
| typedef boost::bimap<Id, Id> capd::complex::FundamentalGroupPaths< DiscreteVectorField >::AcesMap |
| typedef std::vector<std::pair<Id, int> > capd::complex::FundamentalGroupPaths< DiscreteVectorField >::Chain |
| typedef DiscreteVectorField::Complex capd::complex::FundamentalGroupPaths< DiscreteVectorField >::Complex |
| typedef DiscreteVectorField::Id capd::complex::FundamentalGroupPaths< DiscreteVectorField >::Id |
| typedef std::list<PathCell> capd::complex::FundamentalGroupPaths< DiscreteVectorField >::Path |
| typedef std::pair<Id, int> capd::complex::FundamentalGroupPaths< DiscreteVectorField >::PathCell |
| typedef std::map<Id, Path> capd::complex::FundamentalGroupPaths< DiscreteVectorField >::PathsMap |
| typedef PathsMap::iterator capd::complex::FundamentalGroupPaths< DiscreteVectorField >::PathsMapIterator |
|
inlineexplicit |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |