42 #ifndef EpetraExt_BLOCK_ADJACENCY_GRAPH_H
43 #define EpetraExt_BLOCK_ADJACENCY_GRAPH_H
45 #if defined(EpetraExt_SHOW_DEPRECATED_WARNINGS)
47 #warning "The EpetraExt package is deprecated"
53 #include <Teuchos_RCP.hpp>
91 Teuchos::RCP<Epetra_CrsGraph>
compute(
Epetra_CrsGraph& B,
int nbrr, std::vector<int>&r, std::vector<double>& weights,
bool verbose =
false);
94 template<
typename int_type>
95 Teuchos::RCP<Epetra_CrsGraph>
compute(
Epetra_CrsGraph& B,
int nbrr, std::vector<int>&r, std::vector<double>& weights,
bool verbose =
false);
98 int* csr_bst(
int n );
99 int csr_bstrootindex(
int n );
105 #endif //EpetraExt_BLOCK_ADJACENCY_GRAPH_H
~BlockAdjacencyGraph()
Destructor.
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.
int compare_ints(const void *a, const void *b)
Given an Epetra_CrsGraph that has block structure, an adjacency graph is constructed representing the...
BlockAdjacencyGraph()
Constructor.