Rank: 95974 based on 0 downloads (last 30 days) and 0 file submitted
photo

H

E-mail

Personal Profile:

 

Watch this Author's files

 

Comments and Ratings by H View all
Updated File Comments Rating
03 Mar 2010 Sparse sub access This package allows to retrieve and assign values of sparse matrix in one shot. Author: Bruno Luong

This seems to have one problem though:

Before I used A(:,indexes)=0, it just took a lot of time.

No I tried

[I J]=find(A);
idxofzero = ismember(J,indexes);
A=setsparse(A,I(idxofzero),J(idxofzero),0);

And I get "out of memory error". I tried it several times with both methods and got the same result. Am I missing something here?

My sparse matrix is about 55,000 x 55,000 and it has 4,060,200 nnz elements. The indexes hold about 1/100 of the columns.

03 Mar 2010 Sparse sub access This package allows to retrieve and assign values of sparse matrix in one shot. Author: Bruno Luong

Bruno, Thank you very much for this package. Also thank you for all your help in the forums.

This works appr. 30 times faster than using linear indexing to zero sparse matrix columns that I used before!

05 Feb 2010 MatlabBGL MatlabBGL provides robust and efficient graph algorithms for Matlab using native data structures. Author: David Gleich

As it seems, there's also a built function for my problem, path_from_pred.m...

And a next question as well:

I have a graph that represents e.g. cities and the arcs are distances between them. Is there a way to have some kind of maximum length as an constraint to the shortest path problem?

19 Jan 2010 MatlabBGL MatlabBGL provides robust and efficient graph algorithms for Matlab using native data structures. Author: David Gleich

Thank you very much m!

18 Jan 2010 MatlabBGL MatlabBGL provides robust and efficient graph algorithms for Matlab using native data structures. Author: David Gleich

No one has an idea?

Contact us