EpetraExt Development

#include <EpetraExt_BlockAdjacencyGraph.h>
Public Member Functions  
~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. 
Definition at line 62 of file EpetraExt_BlockAdjacencyGraph.h.
EpetraExt::BlockAdjacencyGraph::~BlockAdjacencyGraph  (  )  [inline] 
Destructor.
Definition at line 69 of file EpetraExt_BlockAdjacencyGraph.h.
EpetraExt::BlockAdjacencyGraph::BlockAdjacencyGraph  (  )  [inline] 
Constructor.
Definition at line 74 of file EpetraExt_BlockAdjacencyGraph.h.
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 referencecounted 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 90 of file EpetraExt_BlockAdjacencyGraph.cpp.