Go to the documentation of this file.
46 #ifndef MUELU_AGGREGATIONPHASE2AALGORITHM_DECL_HPP_
47 #define MUELU_AGGREGATIONPHASE2AALGORITHM_DECL_HPP_
81 template <
class LocalOrdinal = int,
82 class GlobalOrdinal = LocalOrdinal,
83 class Node = KokkosClassic::DefaultNode::DefaultNodeType>
86 #undef MUELU_AGGREGATIONPHASE2AALGORITHM_SHORT
115 #define MUELU_AGGREGATIONPHASE2AALGORITHM_SHORT
DASHPOS string(SUBSTRING ${CLASS} 0 ${DASHPOS} CLASS_NAME) set(CONDITION_NAME "") set(CONDITION_NAME_END "") string(SUBSTRING $
Pure virtual base class for all MueLu aggregation algorithms.
AggregationPhase2aAlgorithm(const RCP< const FactoryBase > &graphFact=Teuchos::null)
Constructor.
Namespace for MueLu classes and methods.
virtual ~AggregationPhase2aAlgorithm()
Destructor.
MueLu representation of a graph.
void BuildAggregates(const ParameterList ¶ms, const GraphBase &graph, Aggregates &aggregates, std::vector< unsigned > &aggStat, LO &numNonAggregatedNodes) const
Local aggregation.
Container class for aggregation information.
std::string description() const
Return a simple one-line description of this object.
Among unaggregated points, see if we can make a reasonable size aggregate out of it.