42 #ifndef EpetraExt_CRSGRAPH_SYMMRCM_H
43 #define EpetraExt_CRSGRAPH_SYMMRCM_H
64 : bruteForce_(BruteForce),
65 testLeafWidth_(testLeafWidth),
77 const int testLeafWidth_;
78 const bool bruteForce_;
84 BFT(
const std::vector< std::vector<int> > & adjlist,
89 int Width() {
return width_; }
90 int Depth() {
return depth_; }
92 void NonNeighborLeaves( std::vector<int> & leaves,
93 const std::vector< std::vector<int> > & adjlist,
95 void ReverseVector( std::vector<int> & ordered );
104 std::vector< std::vector<int> > levelSets_;
111 #endif //EpetraExt_CRSGRAPH_SYMMRCM_H
Generates the symmetric RCM reordered version of a Epetra_CrsGraph.
CrsGraph_SymmRCM(bool BruteForce=false, int testLeafWidth=5)
Constructor.
NewTypeRef operator()(OriginalTypeRef orig)
Transformation Operator.
~CrsGraph_SymmRCM()
Destructor.