edgeNum            68 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int edgeNum = 0;
edgeNum            73 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     verttab[i] = edgeNum;
edgeNum            76 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	edgetab[edgeNum] = j;
edgeNum            77 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	edlotab[edgeNum] = (SCOTCH_Num)mat[i][j];
edgeNum            78 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	edgeNum++;
edgeNum            84 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	edgetab[edgeNum] = j;
edgeNum            85 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	edlotab[edgeNum] = (SCOTCH_Num)mat[i][j];
edgeNum            86 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	edgeNum++;
edgeNum           106 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     verttab[i] = edgeNum;
edgeNum           109 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   verttab[i] = edgeNum;
edgeNum           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);
edgeNum           115 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   assert(edgeNum <= edgenbr);
edgeNum           116 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   edgenbr = edgeNum;