MueLu  Version of the Day
MueLu_LWGraph_decl.hpp
Go to the documentation of this file.
1 // @HEADER
2 //
3 // ***********************************************************************
4 //
5 // MueLu: A package for multigrid based preconditioning
6 // Copyright 2012 Sandia Corporation
7 //
8 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
9 // the U.S. Government retains certain rights in this software.
10 //
11 // Redistribution and use in source and binary forms, with or without
12 // modification, are permitted provided that the following conditions are
13 // met:
14 //
15 // 1. Redistributions of source code must retain the above copyright
16 // notice, this list of conditions and the following disclaimer.
17 //
18 // 2. Redistributions in binary form must reproduce the above copyright
19 // notice, this list of conditions and the following disclaimer in the
20 // documentation and/or other materials provided with the distribution.
21 //
22 // 3. Neither the name of the Corporation nor the names of the
23 // contributors may be used to endorse or promote products derived from
24 // this software without specific prior written permission.
25 //
26 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
27 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
30 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
31 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
32 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
33 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
34 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
35 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
36 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 //
38 // Questions? Contact
39 // Jonathan Hu (jhu@sandia.gov)
40 // Andrey Prokopenko (aprokop@sandia.gov)
41 // Ray Tuminaro (rstumin@sandia.gov)
42 //
43 // ***********************************************************************
44 //
45 // @HEADER
46 #ifndef MUELU_LWGRAPH_DECL_HPP
47 #define MUELU_LWGRAPH_DECL_HPP
48 
49 #include <Xpetra_ConfigDefs.hpp> // global_size_t
50 #include <Xpetra_CrsGraph.hpp> // inline functions requires class declaration
51 #include <Xpetra_Map_fwd.hpp>
52 
53 #include "MueLu_ConfigDefs.hpp"
54 
55 #include "MueLu_LWGraph_fwd.hpp"
56 #include "MueLu_GraphBase.hpp"
57 #include "MueLu_Exceptions.hpp"
58 
59 namespace MueLu {
60 
69  template <class LocalOrdinal = int, class GlobalOrdinal = LocalOrdinal, class Node = KokkosClassic::DefaultNode::DefaultNodeType>
70  class LWGraph : public MueLu::GraphBase<LocalOrdinal,GlobalOrdinal,Node> {
71 #undef MUELU_LWGRAPH_SHORT
73 
74  public:
75 
77 
78  LWGraph(const ArrayRCP<const LO>& rowPtrs, const ArrayRCP<const LO>& colPtrs,
79  const RCP<const Map>& domainMap, const RCP<const Map>& rangeMap, const std::string& objectLabel = "")
80  : rows_(rowPtrs), columns_(colPtrs), domainMap_(domainMap), importMap_(rangeMap), domainMapRef_(*domainMap), objectLabel_(objectLabel)
81  {
82  minLocalIndex_ = domainMapRef_.getMinLocalIndex();
83  maxLocalIndex_ = domainMapRef_.getMaxLocalIndex();
84 
86 
87  LO nRows = as<LO>(rowPtrs.size()-1);
88  for (LO i = 0; i < nRows; i++)
89  maxNumRowEntries_ = std::max(maxNumRowEntries_, as<size_t>(rowPtrs[i+1] - rowPtrs[i]));
90  }
91 
92  virtual ~LWGraph() {}
94 
95  size_t GetNodeNumVertices() const { return rows_.size()-1; }
96  size_t GetNodeNumEdges() const { return rows_[rows_.size()-1]; }
97 
98  // TODO: do we really need this function
99  // It is being called from CoupledAggregation, but do we need it there?
102  Teuchos::reduceAll(*domainMap_->getComm(), Teuchos::REDUCE_SUM, in, Teuchos::outArg(out));
103  return out;
104  }
105 
106  const RCP<const Teuchos::Comm<int> > GetComm() const { return domainMap_->getComm(); }
107  const RCP<const Map> GetDomainMap() const { return domainMap_; }
109  const RCP<const Map> GetImportMap() const { return importMap_; }
110 
111  void SetBoundaryNodeMap(RCP<const Map> const &map) { throw Exceptions::NotImplemented("LWGraph: Boundary node map not implemented."); }
112 
115 
117  bool isLocalNeighborVertex(LO i) const { return i >= minLocalIndex_ && i <= maxLocalIndex_; }
118 
121 
123  size_t getNodeMaxNumRowEntries () const { return maxNumRowEntries_; }
124 
127 
128 
130  std::string description() const { return "MueLu.description()"; } //FIXME use object's label
131 
132 
134  //using MueLu::Describable::describe; // overloading, not hiding
135  //void describe(Teuchos::FancyOStream &out, const VerbLevel verbLevel = Default) const;;
136  void print(Teuchos::FancyOStream &out, const VerbLevel verbLevel = Default) const;
137 
138  private:
139 
146  const Map& domainMapRef_;
148  const std::string & objectLabel_;
151 
152  // local index boundaries (cached from domain map)
155  };
156 
157 } // namespace MueLu
158 
159 #define MUELU_LWGRAPH_SHORT
160 #endif // MUELU_LWGRAPH_DECL_HPP
Teuchos::ArrayView< const LO > getNeighborVertices(LO i) const
Return the list of vertices adjacent to the vertex &#39;v&#39;.
bool isLocalNeighborVertex(LO i) const
Return true if vertex with local id &#39;v&#39; is on current process.
size_type size() const
const Map & domainMapRef_
size_t GetNodeNumVertices() const
Return number of vertices owned by the calling node.
const RCP< const Teuchos::Comm< int > > GetComm() const
void print(Teuchos::FancyOStream &out, const VerbLevel verbLevel=Default) const
Print the Graph with some verbosity level to an FancyOStream object.
LocalOrdinal LO
void SetBoundaryNodeMap(RCP< const Map > const &map)
Namespace for MueLu classes and methods.
const RCP< const Map > domainMap_
Graph maps.
const RCP< const Map > GetDomainMap() const
size_t GetNodeNumEdges() const
Return number of edges owned by the calling node.
size_t getNodeMaxNumRowEntries() const
Returns the maximum number of entries across all rows/columns on this node.
const ArrayRCP< const LO > rows_
Indices into columns_ array. Part of local graph information.
Exception throws when you call an unimplemented method of MueLu.
Xpetra::global_size_t GetGlobalNumEdges() const
Return number of global edges in the graph.
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.
size_t global_size_t
LWGraph(const ArrayRCP< const LO > &rowPtrs, const ArrayRCP< const LO > &colPtrs, const RCP< const Map > &domainMap, const RCP< const Map > &rangeMap, const std::string &objectLabel="")
MueLu representation of a graph.
const RCP< const Map > GetImportMap() const
Returns overlapping import map (nodes).
void SetBoundaryNodeMap(const ArrayRCP< const bool > &bndry)
Set boolean array indicating which rows correspond to Dirichlet boundaries.
ArrayView< T > view(size_type lowerOffset, size_type size) const
Lightweight MueLu representation of a compressed row storage graph.
const ArrayRCP< const bool > GetBoundaryNodeMap() const
Returns map with global ids of boundary nodes.
const RCP< const Map > importMap_