46 #ifndef MUELU_AGGREGATIONSTRUCTUREDALGORITHM_DECL_HPP_ 47 #define MUELU_AGGREGATIONSTRUCTUREDALGORITHM_DECL_HPP_ 77 template <
class LocalOrdinal = int,
78 class GlobalOrdinal = LocalOrdinal,
79 class Node = KokkosClassic::DefaultNode::DefaultNodeType>
82 #undef MUELU_AGGREGATIONSTRUCTUREDALGORITHM_SHORT 104 Aggregates& aggregates, std::vector<unsigned>& aggStat,
105 LO& numNonAggregatedNodes)
const;
114 std::string
description()
const {
return "Aggretation: structured algorithm"; }
130 #define MUELU_AGGREGATIONSTRUCTUREDALGORITHM_SHORT Container class for aggregation information.
void ComputeGraphDataConstant(const GraphBase &graph, RCP< IndexManager > &geoData, const int numInterpolationPoints, ArrayRCP< size_t > &nnzOnRow, Array< size_t > &rowPtr, Array< LO > &colIndex) const
Algorithm for coarsening a graph with structured aggregation.
Pure virtual base class for all MueLu aggregation algorithms.
Namespace for MueLu classes and methods.
virtual ~AggregationStructuredAlgorithm()
Destructor.
void BuildAggregates(const Teuchos::ParameterList ¶ms, const GraphBase &graph, Aggregates &aggregates, std::vector< unsigned > &aggStat, LO &numNonAggregatedNodes) const
Local aggregation.
std::string description() const
Return a simple one-line description of this object.
MueLu representation of a graph.
void ComputeGraphDataLinear(const GraphBase &graph, RCP< IndexManager > &geoData, const int numInterpolationPoints, ArrayRCP< size_t > &nnzOnRow, Array< size_t > &rowPtr, Array< LO > &colIndex) const
AggregationStructuredAlgorithm(const RCP< const FactoryBase > &graphFact=Teuchos::null)
Constructor.
void BuildGraph(const GraphBase &graph, RCP< IndexManager > &geoData, RCP< CrsGraph > &myGraph, RCP< const Map > &coarseCoordinatesFineMap, RCP< const Map > &coarseCoordinatesMap) const
Local aggregation.