post_order

void post_order(INT n,
INT *father,
INT *T,
INT *perm,
INT *iperm)

local function

compute_subtree_size

void compute_subtree_size(INT n,
INT *father,
INT *perm,
INT *iperm,
INT *T)

compute_elimination_tree

void compute_elimination_tree(INT n,
INT *ia,
INT *ja,
INT *perm,
INT *iperm,
INT *father)

find_supernodes

void find_supernodes(INT n,
INT *ia,
INT *ja,
INT *perm,
INT *iperm,
INT *snodenbr,
INT *snodetab,
INT *treetab)

post_order

void post_order(INT n,
INT *father,
INT *T,
INT *perm,
INT *iperm)

Check the permutation vector

compute_subtree_size

void compute_subtree_size(INT n,
INT *father,
INT *perm,
INT *iperm,
INT *T)

Compute the iperm vector

compute_elimination_tree

void compute_elimination_tree(INT n,
INT *ia,
INT *ja,
INT *perm,
INT *iperm,
INT *father)
void post_order(INT n,
INT *father,
INT *T,
INT *perm,
INT *iperm)
local function
void compute_subtree_size(INT n,
INT *father,
INT *perm,
INT *iperm,
INT *T)
void compute_elimination_tree(INT n,
INT *ia,
INT *ja,
INT *perm,
INT *iperm,
INT *father)
void find_supernodes(INT n,
INT *ia,
INT *ja,
INT *perm,
INT *iperm,
INT *snodenbr,
INT *snodetab,
INT *treetab)
Close