Here is a list of all namespaces with brief descriptions:

[detail level 12]

▼Ncomma
CAgglomerationArgs	Convenient class holding arguments for the parametrization of the agglomeration algorithm
CAgglomerator	A class responsible to do the interface between the different kinds of agglomerator
CAgglomerator_Anisotropic	Agglomerator_Anisotropic class is a child class of the Agglomerator class that specializes the implementation to the case of Anisotropic agglomeration
CAgglomerator_Biconnected	Child class of Agglomerator_Isotropic where is implemented a specific biconnected algorithm for the agglomeration. We call it biconnected case, but it is the greedy algorithm in reality
CAgglomerator_Isotropic	Agglomerator_Isotropic class is a child class of the Agglomerator class that specializes the implementation to the case of Isotropic agglomeration
CAgglomerator_Iterative	Child class of Agglomerator_Isotropic which implements a specialized iterative algorithm for the search of fine cells
CAnisotropicArgs	Convenient class holding arguments for the parametrization of the anisotropic agglomeration algorithm
CARComputer	Similar to a functor, the key point is the method that computes the AR and update the features of a cell. Here, AR is used lightly, and might be any quantity which should be minimized in the coarsening process. This is an abstract class
CARDiameter	ARComputer. Here, AR is the approximated diameter
CARDiamOverMinEdge	ARComputer. Here, AR is the ratio of the diameter over the smallest edge
CARDiamOverRadius	ARComputer. Here, AR is the ratio of the diameter over the estimated one (typically, in 2D, the squared root of the surface). It is the definition used in CoMMA from 1.1 up to 1.3.2
CARExternalWeightOverRadius	ARComputer. Here, AR is the ratio of the external weights over the measure. With `dim` equal to 2, it is roughly equivalent to the ration of the perimeter and the surface of the cell. Moreover, with `dim` = 2, it is equivalent to the definition used by CoMMA up to version 1.0. For an algebraic version (where no concern is given to adimensionalize the AR), use `dim` equal to 1
CARExternalWeights	ARComputer. Here, AR is the total external weights (that is, from a geometric point of view, the perimeter). Looking for the minimum leads in graph terms to a min-cut
CARMaxBaryDistanceOverRadius	ARComputer. Here, AR is the ratio of the maximum over minimum distance of the cell centers from the barycenter (computed as weighted average of centers). If a cell is totally internal, it won't be included in the computations
CARMaxOverMinBaryDistance	ARComputer. Here, AR is the ratio of the maximum over minimum distance of the cell centers from the barycenter (computed as weighted average of centers). If a cell is totally internal, it won't be included in the computations
CAROverInternalWeights	ARComputer. Here, AR is one over the internal weights (looking for the minimum leads to the maximization of the internal weights)
CAROverMeasure	ARComputer. Here, AR is the reciprocal of the measure, hence the optimal solution should be the one with the max measure
CBimap	An easy and straight forward implementation of a Bimap
CCellFeatures	Convenient class containing salient features of a cell. According to to the chosen AR computation (see ARComputer), some features may be outdated
CCoarse_Cell	Class describing a coarse cell
CCoarse_Cell_Container	Class implementing a custom container where the coarse cells are stored
CCoarse_Cell_Subgraph	Class describing a coarse cell with a full description, that is, it also holds a subgraph describing how the fine cells are connected inside the coarse one
CCustomPairGreaterFunctor	Functor for pairs implementing a custom 'greater than'. It relies on the 'greater than' operator for the second elements and 'less than' for the first ones
CCustomPairLessFunctor	Functor for pairs implementing a custom 'less than'. It relies on the 'less than' operator for the second elements and 'greater than' for the first ones
CDual_Graph	A class implementing the CRS global graph representation of the global mesh
CGraph	An interface class responsible of storing the cell centered dual graph and of acting on it (it is an interface for the global Dual_Graph and the Subgraph)
CGraphArgs	Convenient class holding arguments defining the graph
CNeighbourhood	Class representing the neighbourhood of a given cell in the graph. Mind that no information about the element being already agglomerated or not is known here
CNeighbourhood_Extended	Class representing the neighbourhood of a given cell in the graph. In this derived class the neighbourhood is extended, meaning that all the neighbours seen so far are candidates
CNeighbourhood_Pure_Front	Class representing the neighbourhood of a given cell in the graph. In this derived class, the neighbourhood is 'pure front-advancing', meaning that the next candidates are only the direct neighbours of the last added cell
CNeighbourhoodCreator	Pure abstract class for a creator of Neighbourhood objects. It can create from scratch or by copy
CNeighbourhoodExtendedCreator	Creator of Neighbourhood_Extended objects. It can create from scratch or by copy
CNeighbourhoodPureFrontCreator	Creator of Neighbourhood_Extended objects. It can create from scratch or by copy
CNode	Node data structure that represent a node of the tree
CPairFindFirstBasedFunctor	Functor implementing an operator telling if a given value if the first one of pair
CPairSecondBasedLessFunctor	Functor for pairs implementing a less operator based only on the second element of the pair
CPriority_Pair	Wrapper around the STL pair with custom 'less than' operator: as in the standard case, first we compare the first elements, then the second ones; however it relies on the 'greater than' on the first elements, e.g., (4,X) < (3,Y), whereas standard rules apply to second elements, e.g., (4,3) < (4,4)
CQueue	A template class implementing a custom queue data structure
CSeeds_Pool	Class representing the pool of all the seeds for creating a coarse cell
CSeeds_Pool_Boundary_Priority	Class representing the pool of all the seeds for creating a coarse cell. This derived class gives higher priority to cells that are on the border
CSeeds_Pool_Neighbourhood_Priority	Class representing the pool of all the seeds for creating a coarse cell. This derived class gives higher priority to cells that are neighbours of already existing coarse cells
CSPFullInitializator	Functor performing the full initialization of a seeds pool
CSPInitializator	Functor performing the initialization of a seeds pool
CSPOnePointInitializator	Functor performing the one-point initialization of a seeds pool
CSubgraph	A class implementing the CRS subgraph representation. It is used in the framework of CoMMA for the implementation of the CSR representation of the coarse cells
CTree	Tree structure that represent a coarse cell, the fine cell and the neighbours to them