edgenbr            57 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num edgenbr = vertnbr*vertnbr;			// number of edges
edgenbr            63 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num *edgetab = (SCOTCH_Num *)malloc(sizeof(SCOTCH_Num) * edgenbr);
edgenbr            65 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num *edlotab = (SCOTCH_Num *)malloc(sizeof(SCOTCH_Num) * edgenbr);
edgenbr           112 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     printf("Graph converted to Scotch format: edgeNum=%d, edgenbr = %lld, vertnbr = %lld\n",edgeNum, (long long int)edgenbr, (long long int)vertnbr);
edgenbr           115 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   assert(edgeNum <= edgenbr);
edgenbr           116 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   edgenbr = edgeNum;
edgenbr           119 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_graphBuild(graphptr, 0, vertnbr, verttab, verttab+1, NULL, NULL, edgenbr, edgetab, edlotab);