EpetraExt::BlockAdjacencyGraph Class Reference

#include <EpetraExt_BlockAdjacencyGraph.h>

List of all members.

Public Member Functions

 ~BlockAdjacencyGraph ()
 Destructor.
 BlockAdjacencyGraph ()
 Constructor.
Teuchos::RCP< Epetra_CrsGraphcompute (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.


Detailed Description

Definition at line 49 of file EpetraExt_BlockAdjacencyGraph.h.


Constructor & Destructor Documentation

EpetraExt::BlockAdjacencyGraph::~BlockAdjacencyGraph (  )  [inline]

Destructor.

Definition at line 56 of file EpetraExt_BlockAdjacencyGraph.h.

EpetraExt::BlockAdjacencyGraph::BlockAdjacencyGraph (  )  [inline]

Constructor.

Definition at line 61 of file EpetraExt_BlockAdjacencyGraph.h.


Member Function Documentation

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 77 of file EpetraExt_BlockAdjacencyGraph.cpp.


The documentation for this class was generated from the following files:
Generated on Wed May 12 21:24:50 2010 for EpetraExt by  doxygen 1.4.7