SCOTCH_Num         56 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num vertnbr = n;	// number of vertices
SCOTCH_Num         57 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num edgenbr = vertnbr*vertnbr;			// number of edges
SCOTCH_Num         59 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num *verttab = (SCOTCH_Num *)malloc(sizeof(SCOTCH_Num) * (vertnbr+1));
SCOTCH_Num         63 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num *edgetab = (SCOTCH_Num *)malloc(sizeof(SCOTCH_Num) * edgenbr);
SCOTCH_Num         65 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num *edlotab = (SCOTCH_Num *)malloc(sizeof(SCOTCH_Num) * edgenbr);
SCOTCH_Num         77 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	edlotab[edgeNum] = (SCOTCH_Num)mat[i][j];
SCOTCH_Num         85 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	edlotab[edgeNum] = (SCOTCH_Num)mat[i][j];
SCOTCH_Num        126 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int  check_partition(SCOTCH_Num *parttab, int k, int n){
SCOTCH_Num        152 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num    partnbr = (SCOTCH_Num) k;
SCOTCH_Num        155 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num    straval;
SCOTCH_Num        156 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num   *parttab = (SCOTCH_Num *)MALLOC(sizeof(SCOTCH_Num) * n);
SCOTCH_Num         29 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h #define NETLOC_int SCOTCH_Num