46 #ifndef MUELU_LWGRAPH_DECL_HPP
47 #define MUELU_LWGRAPH_DECL_HPP
69 template <
class LocalOrdinal =
int,
class GlobalOrdinal = LocalOrdinal,
class Node = KokkosClassic::DefaultNode::DefaultNodeType>
71 #undef MUELU_LWGRAPH_SHORT
95 LO nRows = as<LO>(rowPtrs.
size()-1);
96 for (
LO i = 0; i < nRows; i++)
167 #define MUELU_LWGRAPH_SHORT
168 #endif // MUELU_LWGRAPH_DECL_HPP
size_t getNodeMaxNumRowEntries() const
Returns the maximum number of entries across all rows/columns on this node.
const Map & domainMapRef_
const RCP< const Map > GetDomainMap() const
bool isLocalNeighborVertex(LO i) const
Return true if vertex with local id 'v' is on current process.
Teuchos::ArrayView< const LO > getNeighborVertices(LO i) const
Return the list of vertices adjacent to the vertex 'v'.
const RCP< const Map > domainMap_
Graph maps.
LWGraph(const ArrayRCP< const LO > &rowPtrs, const ArrayRCP< const LO > &colPtrs, const RCP< const Map > &domainMap, const RCP< const Map > &importMap, const std::string &objectLabel="")
LWGraph constructor.
const RCP< const Teuchos::Comm< int > > GetComm() const
const ArrayRCP< const LO > rows_
Indices into columns_ array. Part of local graph information.
Exception throws when you call an unimplemented method of MueLu.
std::string description() const
Return a simple one-line description of the Graph.
TEUCHOS_DEPRECATED void reduceAll(const Comm< Ordinal > &comm, const EReductionType reductType, const Packet &send, Packet *globalReduct)
const ArrayRCP< const LO > columns_
Columns corresponding to connections. Part of local graph information.
ArrayRCP< const bool > dirichletBoundaries_
Boolean array marking Dirichlet rows.
const std::string & objectLabel_
Name of this graph.
Xpetra::global_size_t GetGlobalNumEdges() const
Return number of global edges in the graph.
size_t GetNodeNumEdges() const
Return number of edges owned by the calling node.
MueLu representation of a graph.
void SetBoundaryNodeMap(const ArrayRCP< const bool > &bndry)
Set boolean array indicating which rows correspond to Dirichlet boundaries.
void SetBoundaryNodeMap(RCP< const Map > const &)
size_t GetNodeNumVertices() const
Return number of vertices owned by the calling node.
Lightweight MueLu representation of a compressed row storage graph.
void print(Teuchos::FancyOStream &out, const VerbLevel verbLevel=Default) const
Print the Graph with some verbosity level to an FancyOStream object.
const ArrayRCP< const bool > GetBoundaryNodeMap() const
Returns map with global ids of boundary nodes.
const RCP< const Map > GetImportMap() const
Returns overlapping import map (nodes).
const RCP< const Map > importMap_
ArrayView< T > view(size_type lowerOffset, size_type size) const