EpetraExt Package Browser (Single Doxygen Collection)
Development
Loading...
Searching...
No Matches
src
transform
EpetraExt_BlockAdjacencyGraph.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_BLOCK_ADJACENCY_GRAPH_H
43
#define EpetraExt_BLOCK_ADJACENCY_GRAPH_H
44
45
class
Epetra_CrsGraph
;
46
47
#include <Teuchos_RCP.hpp>
48
#include <vector>
49
50
namespace
EpetraExt
{
51
53
60
int
compare_ints
(
const
void
*a,
const
void
*b);
61
62
class
BlockAdjacencyGraph
{
63
64
public
:
65
67
69
~BlockAdjacencyGraph
() {}
70
72
74
BlockAdjacencyGraph
() {}
75
77
85
Teuchos::RCP<Epetra_CrsGraph>
compute
(
Epetra_CrsGraph
& B,
int
nbrr, std::vector<int>&r, std::vector<double>& weights,
bool
verbose =
false
);
86
87
private
:
88
template
<
typename
int
_type>
89
Teuchos::RCP<Epetra_CrsGraph>
compute
(
Epetra_CrsGraph
& B,
int
nbrr, std::vector<int>&r, std::vector<double>& weights,
bool
verbose =
false
);
90
91
// Some binary search tree helper functions.
92
int
*
csr_bst
(
int
n );
93
int
csr_bstrootindex
(
int
n );
94
95
};
96
97
}
//namespace EpetraExt
98
99
#endif
//EpetraExt_BLOCK_ADJACENCY_GRAPH_H
EpetraExt::BlockAdjacencyGraph
Definition
EpetraExt_BlockAdjacencyGraph.h:62
EpetraExt::BlockAdjacencyGraph::compute
Teuchos::RCP< Epetra_CrsGraph > compute(Epetra_CrsGraph &B, int nbrr, std::vector< int > &r, std::vector< double > &weights, bool verbose=false)
Constructs an adjacency graph representing the block connectivity of the input graph,...
Definition
EpetraExt_BlockAdjacencyGraph.cpp:246
EpetraExt::BlockAdjacencyGraph::~BlockAdjacencyGraph
~BlockAdjacencyGraph()
Destructor.
Definition
EpetraExt_BlockAdjacencyGraph.h:69
EpetraExt::BlockAdjacencyGraph::csr_bst
int * csr_bst(int n)
Definition
EpetraExt_BlockAdjacencyGraph.cpp:271
EpetraExt::BlockAdjacencyGraph::BlockAdjacencyGraph
BlockAdjacencyGraph()
Constructor.
Definition
EpetraExt_BlockAdjacencyGraph.h:74
EpetraExt::BlockAdjacencyGraph::csr_bstrootindex
int csr_bstrootindex(int n)
Definition
EpetraExt_BlockAdjacencyGraph.cpp:308
Epetra_CrsGraph
EpetraExt
EpetraExt::BlockCrsMatrix: A class for constructing a distributed block matrix.
Definition
EpetraExt_BlockCrsMatrix.cpp:46
EpetraExt::compare_ints
int compare_ints(const void *a, const void *b)
Given an Epetra_CrsGraph that has block structure, an adjacency graph is constructed representing the...
Definition
EpetraExt_BlockAdjacencyGraph.cpp:54
Generated by
1.10.0