|
| LocalOrderingSolution (lno_t perm_size) |
|
| OrderingSolution (lno_tperm_size) |
| Constructor allocates memory for the solution. More...
|
|
bool | havePerm () const |
| Do we have the direct permutation? More...
|
|
void | setHavePerm (bool status) |
| Set havePerm (intended for ordering algorithms only) More...
|
|
bool | haveInverse () const |
| Do we have the inverse permutation? More...
|
|
void | setHaveInverse (bool status) |
| Set haveInverse (intended for ordering algorithms only) More...
|
|
void | setHaveSeparator (bool status) |
| set all separator flags. More...
|
|
bool | haveSeparatorRange () const |
| Do we have the separator range? More...
|
|
void | setHaveSeparatorRange (bool status) |
| Set haveSeparatorRange (intended for ordering algorithms only) More...
|
|
bool | haveSeparatorTree () const |
| Do we have the separator tree? More...
|
|
bool | haveSeparators () const |
| Do we have the separators? More...
|
|
void | setHaveSeparatorTree (bool status) |
| Set haveSeparatorTree (intended for ordering algorithms only) More...
|
|
void | computePerm () |
| Compute direct permutation from inverse. More...
|
|
void | computeInverse () |
| Compute inverse permutation. More...
|
|
void | setNumSeparatorBlocks (lno_tnblks) |
| Set number of separator column blocks. More...
|
|
size_t | getPermutationSize () const |
| Get (local) size of permutation. More...
|
|
lno_t | getNumSeparatorBlocks () const |
| Get number of separator column blocks. More...
|
|
const ArrayRCP< lno_t > & | getPermutationRCP (bool inverse=false) const |
| Get (local) permuted GIDs by RCP. More...
|
|
bool | getVertexSeparator (lno_t &numBlocks, lno_t *range, lno_t *tree) const |
| return vertex separator variables by reference. More...
|
|
const ArrayRCP< lno_t > & | getSeparatorRangeRCP () const |
| Get (local) separator range by RCP. More...
|
|
const ArrayRCP< lno_t > & | getSeparatorTreeRCP () const |
| Get (local) separator tree by RCP. More...
|
|
ArrayRCP< lno_t > & | getPermutationRCPConst (bool inverse=false) const |
| Get (local) permuted GIDs by const RCP. More...
|
|
ArrayRCP< lno_t > & | getSeparatorRangeRCPConst () const |
| Get separator range by const RCP. More...
|
|
ArrayRCP< lno_t > & | getSeparatorTreeRCPConst () const |
| Get separator tree by const RCP. More...
|
|
lno_t * | getPermutationView (bool inverse=false) const |
| Get pointer to permutation. If inverse = true, return inverse permutation. By default, perm[i] is where new index i can be found in the old ordering. When inverse==true, perm[i] is where old index i can be found in the new ordering. More...
|
|
lno_t * | getSeparatorRangeView () const |
| Get pointer to separator range. More...
|
|
lno_t * | getSeparatorTreeView () const |
| Get pointer to separator tree. More...
|
|
lno_t & | NumSeparatorBlocks () |
| Get reference to separator column block. More...
|
|
int | validatePerm () |
| returns 0 if permutation is valid, negative if invalid. More...
|
|
virtual | ~Solution () |
|