1 2 #if !defined(__ADJ_H) 3 #define __ADJ_H 4 #include <private/matimpl.h> 5 6 7 /* 8 MATMPIAdj format - Compressed row storage for storing adjacency lists, and possibly weights 9 This is for grid reorderings (to reduce bandwidth) 10 grid partitionings, etc. This is NOT currently a dynamic data-structure. 11 12 */ 13 14 typedef struct { 15 PetscInt nz; 16 PetscInt *diag; /* pointers to diagonal elements, if they exist */ 17 PetscInt *i; /* pointer to beginning of each row */ 18 PetscInt *j; /* column values: j + i[k] is start of row k */ 19 PetscInt *values; /* numerical values */ 20 PetscBool symmetric; /* user indicates the nonzero structure is symmetric */ 21 PetscBool freeaij; /* free a, i,j at destroy */ 22 PetscBool freeaijwithfree; /* use free() to free i,j instead of PetscFree() */ 23 } Mat_MPIAdj; 24 25 #endif 26