MueLu  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
MueLu_Graph_def.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_GRAPH_DEF_HPP
47 #define MUELU_GRAPH_DEF_HPP
48 
49 #include "Xpetra_Map.hpp"
50 #include "Xpetra_CrsGraph.hpp"
51 
52 #include "MueLu_Graph_decl.hpp"
53 #include "MueLu_Exceptions.hpp"
54 
55 namespace MueLu {
56 
57 template <class LocalOrdinal, class GlobalOrdinal, class Node>
58 Graph<LocalOrdinal, GlobalOrdinal, Node>::Graph(const RCP<const CrsGraph> &graph, const std::string & /* objectLabel */)
59  : graph_(graph) {
60  minLocalIndex_ = graph_->getDomainMap()->getMinLocalIndex();
61  maxLocalIndex_ = graph_->getDomainMap()->getMaxLocalIndex();
62 }
63 
64 #ifdef MUELU_UNUSED
65 template <class LocalOrdinal, class GlobalOrdinal, class Node>
67  /*
68  Ray's comments about nGhost:
69  Graph->NGhost == graph_->RowMatrixColMap()->NumMyElements() - graph_->MatrixDomainMap()->NumMyElements()
70  is basically right. But we've had some issues about how epetra handles empty columns.
71  Probably worth discussing this with Jonathan and Chris to see if this is ALWAYS right.
72  */
73  size_t nGhost = graph_->getColMap()->getLocalNumElements() - graph_->getDomainMap()->getLocalNumElements();
74  if (nGhost < 0) nGhost = 0; // FIXME: size_t is unsigned.
75 
76  return nGhost;
77 }
78 #endif
79 
81 // using MueLu::Describable::describe; // overloading, not hiding
82 // void describe(Teuchos::FancyOStream &out, const VerbLevel verbLevel = Default) const {
83 template <class LocalOrdinal, class GlobalOrdinal, class Node>
86 
87  if (verbLevel & Parameters0) {
88  // out0 << "Prec. type: " << type_ << std::endl;
89  }
90 
91  if (verbLevel & Parameters1) {
92  // out0 << "Linear Algebra: " << toString(lib_) << std::endl;
93  // out0 << "PrecType: " << type_ << std::endl;
94  // out0 << "Parameter list: " << std::endl; { Teuchos::OSTab tab2(out); out << paramList_; }
95  // out0 << "Overlap: " << overlap_ << std::endl;
96  }
97 
98  if (verbLevel & Debug) {
99  graph_->describe(out0, Teuchos::VERB_EXTREME);
100  }
101 }
102 
103 } // namespace MueLu
104 
105 #endif // MUELU_GRAPH_DEF_HPP
MueLu representation of a compressed row storage graph.
Print additional debugging information.
RCP< const CrsGraph > graph_
void print(Teuchos::FancyOStream &out, const VerbLevel verbLevel=Default) const
Print the Graph with some verbosity level to an FancyOStream object.
Graph(const RCP< const CrsGraph > &graph, const std::string &="")
#define MUELU_DESCRIBE
Helper macro for implementing Describable::describe() for BaseClass objects.
Print class parameters.
Print class parameters (more parameters, more verbose)