1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
#ifndef __TM_TREE_H__
#define __TM_TREE_H__
#include <stdlib.h>
#include "treematch.h"
OMPI_HIDDEN void tm_update_val(tm_affinity_mat_t *aff_mat,tm_tree_t *parent);
OMPI_HIDDEN void tm_display_tab(double **tab,int N);
OMPI_HIDDEN void tm_set_node(tm_tree_t *node,tm_tree_t ** child, int arity,tm_tree_t *parent,
int id,double val,tm_tree_t *tab_child,int depth);
typedef struct _group_list_t{
struct _group_list_t *next;
tm_tree_t **tab;
double val;
double sum_neighbour;
double wg;
int id;
double *bound;
}group_list_t;
typedef struct{
int i;
int j;
double val;
}adjacency_t;
typedef struct _work_unit_t{
int nb_groups;
int *tab_group;
int done;
int nb_work;
struct _work_unit_t *next;
}work_unit_t;
#endif
|
