1 /* $Id: mpiadj.h,v 1.6 2000/04/09 03:10:00 bsmith Exp bsmith $ */ 2 3 #include "src/mat/matimpl.h" 4 5 #if !defined(__ADJ_H) 6 #define __ADJ_H 7 8 /* 9 MATMPIAdj format - Compressed row storage for storing adjacency lists, and possibly weights 10 This is for grid reorderings (to reduce bandwidth) 11 grid partitionings, etc. This is NOT currently a dynamic data-structure. 12 13 */ 14 15 typedef struct { 16 int *rowners; /* ranges owned by each processor */ 17 int rstart,rend; /* start and end of local rows */ 18 int m; /* local rows */ 19 int nz; 20 int *diag; /* pointers to diagonal elements, if they exist */ 21 int *i; /* pointer to beginning of each row */ 22 int *j; /* column values: j + i[k] - 1 is start of row k */ 23 int *values; /* numerical values */ 24 PetscTruth symmetric; /* user indicates the nonzero structure is symmetric */ 25 PetscTruth freeaij; /* call PetscFree() on a, i,j at destroy */ 26 } Mat_MPIAdj; 27 28 #endif 29