 /* 
  * Copyright 1997, Regents of the University of Minnesota 
  * 
  * debug.c 
  * 
  * This file contains code that performs self debuging 
  * 
  * Started 7/24/97 
  * George 
  * 
  * $Id: debug.c,v 1.1 1998/11/27 17:59:13 karypis Exp $ 
  * 
  */ 

 #include <metis.h> 

 /************************************************************************* 
 * This function computes the cut given the graph and a where vector 
 **************************************************************************/ 
 long ComputeCut(GraphType *graph, idxtype *where) 
 { 
   long i, j, cut; 

   if (graph->adjwgt == NULL) { 
     for (cut=0, i=0; i<graph->nvtxs; i++) { 
       for (j=graph->xadj[i]; j<graph->xadj[i+1]; j++) 
         if (where[i] != where[graph->adjncy[j]]) 
           cut++; 
     } 
   } 
   else { 
     for (cut=0, i=0; i<graph->nvtxs; i++) { 
       for (j=graph->xadj[i]; j<graph->xadj[i+1]; j++) 
         if (where[i] != where[graph->adjncy[j]]) 
           cut += graph->adjwgt[j]; 
     } 
   } 

   return cut/2; 
 } 


 /************************************************************************* 
 * This function checks whether or not the boundary information is correct 
 **************************************************************************/ 
 long CheckBnd(GraphType *graph)  
 { 
   long i, j, nvtxs, nbnd; 
   idxtype *xadj, *adjncy, *where, *bndptr, *bndind; 

   nvtxs = graph->nvtxs; 
   xadj = graph->xadj; 
   adjncy = graph->adjncy; 
   where = graph->where; 
   bndptr = graph->bndptr; 
   bndind = graph->bndind; 

   for (nbnd=0, i=0; i<nvtxs; i++) { 
     if (xadj[i+1]-xadj[i] == 0) 
       nbnd++;   /* Islands are considered to be boundary vertices */ 

     for (j=xadj[i]; j<xadj[i+1]; j++) { 
       if (where[i] != where[adjncy[j]]) { 
         nbnd++; 
         ASSERT(bndptr[i] != -1); 
         ASSERT(bndind[bndptr[i]] == i); 
         break; 
       } 
     } 
   } 

   ASSERTP(nbnd == graph->nbnd, ("%ld %ld\n", nbnd, graph->nbnd)); 

   return 1; 
 } 



 /************************************************************************* 
 * This function checks whether or not the boundary information is correct 
 **************************************************************************/ 
 long CheckBnd2(GraphType *graph)  
 { 
   long i, j, nvtxs, nbnd, id, ed; 
   idxtype *xadj, *adjncy, *where, *bndptr, *bndind; 

   nvtxs = graph->nvtxs; 
   xadj = graph->xadj; 
   adjncy = graph->adjncy; 
   where = graph->where; 
   bndptr = graph->bndptr; 
   bndind = graph->bndind; 

   for (nbnd=0, i=0; i<nvtxs; i++) { 
     id = ed = 0; 
     for (j=xadj[i]; j<xadj[i+1]; j++) { 
       if (where[i] != where[adjncy[j]])  
         ed += graph->adjwgt[j]; 
       else 
         id += graph->adjwgt[j]; 
     } 
     if (ed - id >= 0 && xadj[i] < xadj[i+1]) { 
       nbnd++; 
       ASSERTP(bndptr[i] != -1, ("%ld %ld %ld\n", i, id, ed)); 
       ASSERT(bndind[bndptr[i]] == i); 
     } 
   } 

   ASSERTP(nbnd == graph->nbnd, ("%ld %ld\n", nbnd, graph->nbnd)); 

   return 1; 
 } 

 /************************************************************************* 
 * This function checks whether or not the boundary information is correct 
 **************************************************************************/ 
 long CheckNodeBnd(GraphType *graph, long onbnd)  
 { 
   long i, j, nvtxs, nbnd; 
   idxtype *xadj, *adjncy, *where, *bndptr, *bndind; 

   nvtxs = graph->nvtxs; 
   xadj = graph->xadj; 
   adjncy = graph->adjncy; 
   where = graph->where; 
   bndptr = graph->bndptr; 
   bndind = graph->bndind; 

   for (nbnd=0, i=0; i<nvtxs; i++) { 
     if (where[i] == 2)  
       nbnd++;    
   } 

   ASSERTP(nbnd == onbnd, ("%ld %ld\n", nbnd, onbnd)); 

   for (i=0; i<nvtxs; i++) { 
     if (where[i] != 2) { 
       ASSERTP(bndptr[i] == -1, ("%ld %ld\n", i, bndptr[i])); 
     } 
     else { 
       ASSERTP(bndptr[i] != -1, ("%ld %ld\n", i, bndptr[i])); 
     } 
   } 

   return 1; 
 } 



 /************************************************************************* 
 * This function checks whether or not the rinfo of a vertex is consistent 
 **************************************************************************/ 
 long CheckRInfo(RInfoType *rinfo) 
 { 
   long i, j; 

   for (i=0; i<rinfo->ndegrees; i++) { 
     for (j=i+1; j<rinfo->ndegrees; j++) 
       ASSERTP(rinfo->edegrees[i].pid != rinfo->edegrees[j].pid, ("%ld %ld %ld %ld\n", i, j, rinfo->edegrees[i].pid, rinfo->edegrees[j].pid)); 
   } 

   return 1; 
 } 



 /************************************************************************* 
 * This function checks the correctness of the NodeFM data structures 
 **************************************************************************/ 
 long CheckNodePartitionParams(GraphType *graph) 
 { 
   long i, j, k, l, nvtxs, me, other; 
   idxtype *xadj, *adjncy, *adjwgt, *vwgt, *where; 
   idxtype edegrees[2], pwgts[3]; 

   nvtxs = graph->nvtxs; 
   xadj = graph->xadj; 
   vwgt = graph->vwgt; 
   adjncy = graph->adjncy; 
   adjwgt = graph->adjwgt; 

   where = graph->where; 

   /*------------------------------------------------------------ 
   / Compute now the separator external degrees 
   /------------------------------------------------------------*/ 
   pwgts[0] = pwgts[1] = pwgts[2] = 0; 
   for (i=0; i<nvtxs; i++) { 
     me = where[i]; 
     pwgts[me] += vwgt[i]; 

     if (me == 2) { /* If it is on the separator do some computations */ 
       edegrees[0] = edegrees[1] = 0; 

       for (j=xadj[i]; j<xadj[i+1]; j++) { 
         other = where[adjncy[j]]; 
         if (other != 2) 
           edegrees[other] += vwgt[adjncy[j]]; 
       } 
       if (edegrees[0] != graph->nrinfo[i].edegrees[0] || edegrees[1] != graph->nrinfo[i].edegrees[1]) { 
         printf("Something wrong with edegrees: %ld %ld %ld %ld %ld\n", i, edegrees[0], edegrees[1], graph->nrinfo[i].edegrees[0], graph->nrinfo[i].edegrees[1]); 
         return 0; 
       } 
     } 
   } 

   if (pwgts[0] != graph->pwgts[0] || pwgts[1] != graph->pwgts[1] || pwgts[2] != graph->pwgts[2]) 
     printf("Something wrong with part-weights: %ld %ld %ld %ld %ld %ld\n", pwgts[0], pwgts[1], pwgts[2], graph->pwgts[0], graph->pwgts[1], graph->pwgts[2]); 

   return 1; 
 } 


 /************************************************************************* 
 * This function checks if the separator is indeed a separator 
 **************************************************************************/ 
 long IsSeparable(GraphType *graph) 
 { 
   long i, j, nvtxs, other; 
   idxtype *xadj, *adjncy, *where; 

   nvtxs = graph->nvtxs; 
   xadj = graph->xadj; 
   adjncy = graph->adjncy; 
   where = graph->where; 

   for (i=0; i<nvtxs; i++) { 
     if (where[i] == 2) 
       continue; 
     other = (where[i]+1)%2; 
     for (j=xadj[i]; j<xadj[i+1]; j++) { 
       ASSERTP(where[adjncy[j]] != other, ("%ld %ld %ld %ld %ld %ld\n", i, where[i], adjncy[j], where[adjncy[j]], xadj[i+1]-xadj[i], xadj[adjncy[j]+1]-xadj[adjncy[j]])); 
     } 
   } 

   return 1; 
 } 


