文件名称:mexSparseLogical0Diag
介绍说明－－下载内容均来自于网络，请自行研究使用
Because of memory constraints, it is often impossible to change by subscr ipt 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).-Because of memory constraints, it is often impossible to change by subscr ipt 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).
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).-Because of memory constraints, it is often impossible to change by subscr ipt 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
mexLogicalSparse0Diag.cpp
mexLogicalSparse0Diag.m