Creates a sparse matrix representing an adjacency list. The matrix does not have numerical values associated with it, but is intended for ordering (to reduce bandwidth etc) and partitioning.
comm - MPI communicator
m - number of local rows
N - number of global columns
i - the indices into j for the start of each row
j - the column indices for each row (sorted for each row). The indices in i and j start with zero (NOT with one).
values - [optional] edge weights
A - the matrix
You must NOT free the ii, values and jj arrays yourself. PETSc will free them
when the matrix is destroyed; you must allocate them with
PetscMalloc(). If you
call from Fortran you need not create the arrays with
You should not include the matrix diagonals.