#include <EpetraExt_BlockAdjacencyGraph.h>
|
| ~BlockAdjacencyGraph () |
| Destructor.
|
|
| BlockAdjacencyGraph () |
| Constructor.
|
|
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, where nbrr is the number of block rows in B and r contains the row index where each block begins.
|
|
◆ ~BlockAdjacencyGraph()
EpetraExt::BlockAdjacencyGraph::~BlockAdjacencyGraph |
( |
| ) |
|
|
inline |
◆ BlockAdjacencyGraph()
EpetraExt::BlockAdjacencyGraph::BlockAdjacencyGraph |
( |
| ) |
|
|
inline |
◆ compute() [1/2]
Teuchos::RCP< Epetra_CrsGraph > EpetraExt::BlockAdjacencyGraph::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, where nbrr
is the number of block rows in B
and r
contains the row index where each block begins.
A reference-counted pointer to an Epetra_CrsGraph that has nbrr
rows is returned as well as the vector of weights
. This vector is of length nbrr
returns some weighting on the block adjacency graph that can be used to balance the original graph B
. Right now, that weighting is just the number of rows in each block.
Definition at line 246 of file EpetraExt_BlockAdjacencyGraph.cpp.
◆ compute() [2/2]
template<typename int_type >
Teuchos::RCP< Epetra_CrsGraph > EpetraExt::BlockAdjacencyGraph::compute |
( |
Epetra_CrsGraph & | B, |
|
|
int | nbrr, |
|
|
std::vector< int > & | r, |
|
|
std::vector< double > & | weights, |
|
|
bool | verbose = false ) |
|
private |
◆ csr_bst()
int * EpetraExt::BlockAdjacencyGraph::csr_bst |
( |
int | n | ) |
|
|
private |
◆ csr_bstrootindex()
int EpetraExt::BlockAdjacencyGraph::csr_bstrootindex |
( |
int | n | ) |
|
|
private |
The documentation for this class was generated from the following files: