vertnbr            56 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num vertnbr = n;	// number of vertices
vertnbr            57 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num edgenbr = vertnbr*vertnbr;			// number of edges
vertnbr            59 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_Num *verttab = (SCOTCH_Num *)malloc(sizeof(SCOTCH_Num) * (vertnbr+1));
vertnbr           105 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   for(i = com_mat->n ; i<vertnbr ; i++) {
vertnbr           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);
vertnbr           119 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   SCOTCH_graphBuild(graphptr, 0, vertnbr, verttab, verttab+1, NULL, NULL, edgenbr, edgetab, edlotab);