UnionSet

extern void UnionSet(INT *set1,
INT n1,
INT *set2,
INT n2,
INT *set,
INT *n)

2 percents

cblk_time_fact

double cblk_time_fact (INT n,
INT *ja,
INT colnbr)

cblk_time_solve

double cblk_time_solve(INT n,
INT *ja,
INT colnbr)

merge_cost

INT merge_cost(INT a,
INT b,
csptr P,
INT *colweight)

merge_gain

double merge_gain(INT a,
INT b,
csptr P,
INT *colweight,
INT *tmp)

merge_col

void merge_col (INT a,
INT b,
csptr P)

get_son

void get_son(INT node,
INT *sonindex,
INT *sontab,
INT *colweight,
INT *ns,
INT *list)

amalgamate

void amalgamate(double rat,
csptr P,
INT snodenbr,
INT *snodetab,
INT *treetab,
INT *cblknbr,
INT **rangtab,
INT *nodetab,
MPI_Comm pastix_comm)

merge_cost

INT merge_cost(INT a,
INT b,
csptr P,
INT *colweight)

The matrix should be still sorted

get_son

void get_son(INT node,
INT *sonindex,
INT *sontab,
INT *colweight,
INT *ns,
INT *list)

ja1[i1] == ja2[i2]

merge_col

void merge_col(INT a,
INT b,
csptr P)

merge_gain

double merge_gain(INT a,
INT b,
csptr P,
INT *colweight,
INT *tmp)

cblk_time_fact

double cblk_time_fact(INT n,
INT *ja,
INT colnbr)

cblk_time_solve

double cblk_time_solve(INT n,
INT *ja,
INT colnbr)

Contributions

extern void UnionSet(INT *set1,
INT n1,
INT *set2,
INT n2,
INT *set,
INT *n)
2 percents
double cblk_time_fact (INT n,
INT *ja,
INT colnbr)
double cblk_time_solve(INT n,
INT *ja,
INT colnbr)
INT merge_cost(INT a,
INT b,
csptr P,
INT *colweight)
double merge_gain(INT a,
INT b,
csptr P,
INT *colweight,
INT *tmp)
void merge_col (INT a,
INT b,
csptr P)
void get_son(INT node,
INT *sonindex,
INT *sontab,
INT *colweight,
INT *ns,
INT *list)
void amalgamate(double rat,
csptr P,
INT snodenbr,
INT *snodetab,
INT *treetab,
INT *cblknbr,
INT **rangtab,
INT *nodetab,
MPI_Comm pastix_comm)
Close