Because of memory constraints, it is often impossible to change by subscript all the elements of a large sparse matrix to zero. This leads to changing the elements in a loop, which is horrendously slow. This mex solves that problem. Usage: B = mexSparseLogical0Diag(A). This problem is very common when dealing with adjacency matrices used in clustering- an adjacency matrix is a logical matrix, where the main diagonal is all zeros (no element is a neighbour of itself).

license.txt
mexLogicalSparse0Diag.cpp
mexLogicalSparse0Diag.m

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．