PaStiX Handbook
6.3.2
|
Go to the source code of this file.
Functions | |
static void | compute_subtree_size (pastix_int_t n, const pastix_int_t *father, const pastix_int_t *iperm, pastix_int_t *T) |
Computes the size of each subtree. More... | |
static void | compute_post_order (pastix_int_t n, const pastix_int_t *father, pastix_int_t *perm, pastix_int_t *invp, pastix_int_t *T) |
Computes the post order of the elimination tree given on entry. More... | |
static void | compute_elimination_tree (pastix_int_t n, const pastix_int_t *ia, const pastix_int_t *ja, const pastix_int_t *perm, const pastix_int_t *invp, pastix_int_t *father) |
Compute the elimination tree of a matrix A (without computing the symbolic factorization) associated with a reordering of the matrix. More... | |
void | orderFindSupernodes (const pastix_graph_t *graph, pastix_order_t *const ordeptr) |
Computes the set of supernodes for a given permutation. More... | |
PaStiX order function to find supernodes out of a given permutation.
Definition in file order_find_supernodes.c.