EpetraExt Package Browser (Single Doxygen Collection)  Development
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
EpetraExt_SymmRCM_CrsGraph.h
Go to the documentation of this file.
1 //@HEADER
2 // ***********************************************************************
3 //
4 // EpetraExt: Epetra Extended - Linear Algebra Services Package
5 // Copyright (2011) Sandia Corporation
6 //
7 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
8 // the U.S. Government retains certain rights in this software.
9 //
10 // Redistribution and use in source and binary forms, with or without
11 // modification, are permitted provided that the following conditions are
12 // met:
13 //
14 // 1. Redistributions of source code must retain the above copyright
15 // notice, this list of conditions and the following disclaimer.
16 //
17 // 2. Redistributions in binary form must reproduce the above copyright
18 // notice, this list of conditions and the following disclaimer in the
19 // documentation and/or other materials provided with the distribution.
20 //
21 // 3. Neither the name of the Corporation nor the names of the
22 // contributors may be used to endorse or promote products derived from
23 // this software without specific prior written permission.
24 //
25 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 //
37 // Questions? Contact Michael A. Heroux (maherou@sandia.gov)
38 //
39 // ***********************************************************************
40 //@HEADER
41 
42 #ifndef EpetraExt_CRSGRAPH_SYMMRCM_H
43 #define EpetraExt_CRSGRAPH_SYMMRCM_H
44 
45 #if defined(EpetraExt_SHOW_DEPRECATED_WARNINGS)
46 #ifdef __GNUC__
47 #warning "The EpetraExt package is deprecated"
48 #endif
49 #endif
50 
51 #include <vector>
52 
53 #include <EpetraExt_Transform.h>
54 
55 class Epetra_Map;
56 class Epetra_CrsGraph;
57 
58 namespace EpetraExt {
59 
61 struct CrsGraph_SymmRCM : public StructuralSameTypeTransform<Epetra_CrsGraph> {
62 
63  public:
64 
67 
69  CrsGraph_SymmRCM( bool BruteForce = false, int testLeafWidth = 5 )
70  : bruteForce_(BruteForce),
71  testLeafWidth_(testLeafWidth),
72  RCMMap_(0),
73  RCMColMap_(0)
74  {}
75 
78 
79  private:
80 
83  const int testLeafWidth_;
84  const bool bruteForce_;
85 
86  class BFT {
87 
88  public:
89 
90  BFT( const std::vector< std::vector<int> > & adjlist,
91  int root,
92  int max_width,
93  bool & failed );
94 
95  int Width() { return width_; }
96  int Depth() { return depth_; }
97 
98  void NonNeighborLeaves( std::vector<int> & leaves,
99  const std::vector< std::vector<int> > & adjlist,
100  int count );
101  void ReverseVector( std::vector<int> & ordered );
102 
103  private:
104 
105  bool failed_;
106  int width_;
107  int depth_;
108  int nodes_;
109 
110  std::vector< std::vector<int> > levelSets_;
111  };
112 
113 };
114 
115 } //namespace EpetraExt
116 
117 #endif //EpetraExt_CRSGRAPH_SYMMRCM_H
Generates the symmetric RCM reordered version of a Epetra_CrsGraph.
CrsGraph_SymmRCM(bool BruteForce=false, int testLeafWidth=5)
Constructor.
NewTypeRef operator()(OriginalTypeRef orig)
Transformation Operator.
std::vector< std::vector< int > > levelSets_
void NonNeighborLeaves(std::vector< int > &leaves, const std::vector< std::vector< int > > &adjlist, int count)
~CrsGraph_SymmRCM()
Destructor.
void ReverseVector(std::vector< int > &ordered)
BFT(const std::vector< std::vector< int > > &adjlist, int root, int max_width, bool &failed)