This file contains some data structures and functions aimed at computing combinatorial index pairs. More...
#include "chomp/homology/cubisets.h"
#include "chomp/cubes/cube.h"
#include "chomp/cubes/cell.h"
#include "chomp/struct/digraph.h"
#include <iostream>
#include <fstream>
#include <cstdlib>
Go to the source code of this file.
Classes | |
class | chomp::homology::MapClass< TCube, TSetOfCubes > |
This is a general map class that may be inherited by your particular class that computes a map. More... | |
class | chomp::homology::BufferedMapClass< TCube > |
This class is a wrapper for a map that computes the image of a cube as a rectangular box (i.e., using the interval arithmetic). More... | |
Namespaces | |
namespace | chomp |
This namespace contains the entire CHomP library interface. | |
namespace | chomp::homology |
This namespace contains the core of the homology computation procedures and related classes and templates contained in the CHomP C++ library. | |
Functions | |
template<class TCube > | |
std::ostream & | chomp::homology::operator<< (std::ostream &out, const BufferedMapClass< TCube > &map) |
template<class TSetOfCubes > | |
int | chomp::homology::neighborhood (const TSetOfCubes &X, TSetOfCubes &result) |
Computes a cubical neighborhood of width 1 around the set. | |
template<class TSetOfCubes , class TMap > | |
void | chomp::homology::invariantpart (TSetOfCubes &X, const TMap &F, TSetOfCubes &result) |
Computes X := Inv (X). | |
template<class HSet > | |
bool | chomp::homology::inclusion (const HSet &X, const HSet &Y) |
Verifies if X is a subset of Y. Returns true if yes, false if not. | |
template<class TSetOfCubes , class TMap > | |
int | chomp::homology::ExitSetM (const TSetOfCubes &N, const TSetOfCubes &Q1, const TMap &F, TSetOfCubes &resultQ2) |
Computes iteratively Q2 := (F (Q1 + Q2) - Q1) * N. | |
template<class TSetOfCubes , class TMap > | |
int | chomp::homology::IndexPairM (const TMap &F, const TSetOfCubes &initialS, TSetOfCubes &resultQ1, TSetOfCubes &resultQ2) |
Constructs a combinatorial index pair satisfying Mrozek's definition. | |
template<class TSetOfCubes , class TMap > | |
int | chomp::homology::IndexPairP (const TMap &F, const TSetOfCubes &initialS, TSetOfCubes &resultQ1, TSetOfCubes &resultQ2) |
Constructs a combinatorial index pair satisfying Pilarczyk's definition. |
This file contains some data structures and functions aimed at computing combinatorial index pairs.
Definition in file indxpalg.h.