EpetraExt Package Browser (Single Doxygen Collection) Development
Loading...
Searching...
No Matches
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#include <vector>
46
47#include <EpetraExt_Transform.h>
48
49class Epetra_Map;
50class Epetra_CrsGraph;
51
52namespace EpetraExt {
53
55struct CrsGraph_SymmRCM : public StructuralSameTypeTransform<Epetra_CrsGraph> {
56
57 public:
58
61
63 CrsGraph_SymmRCM( bool BruteForce = false, int testLeafWidth = 5 )
64 : bruteForce_(BruteForce),
65 testLeafWidth_(testLeafWidth),
66 RCMMap_(0),
67 RCMColMap_(0)
68 {}
69
72
73 private:
74
77 const int testLeafWidth_;
78 const bool bruteForce_;
79
80 class BFT {
81
82 public:
83
84 BFT( const std::vector< std::vector<int> > & adjlist,
85 int root,
86 int max_width,
87 bool & failed );
88
89 int Width() { return width_; }
90 int Depth() { return depth_; }
91
92 void NonNeighborLeaves( std::vector<int> & leaves,
93 const std::vector< std::vector<int> > & adjlist,
94 int count );
95 void ReverseVector( std::vector<int> & ordered );
96
97 private:
98
99 bool failed_;
103
104 std::vector< std::vector<int> > levelSets_;
105 };
106
107};
108
109} //namespace EpetraExt
110
111#endif //EpetraExt_CRSGRAPH_SYMMRCM_H
void NonNeighborLeaves(std::vector< int > &leaves, const std::vector< std::vector< int > > &adjlist, int count)
BFT(const std::vector< std::vector< int > > &adjlist, int root, int max_width, bool &failed)
void ReverseVector(std::vector< int > &ordered)
std::vector< std::vector< int > > levelSets_
EpetraExt::BlockCrsMatrix: A class for constructing a distributed block matrix.
Generates the symmetric RCM reordered version of a Epetra_CrsGraph.
NewTypeRef operator()(OriginalTypeRef orig)
Transformation Operator.
CrsGraph_SymmRCM(bool BruteForce=false, int testLeafWidth=5)
Constructor.