Watch this Author's files
This seems to have one problem though:
Before I used A(:,indexes)=0, it just took a lot of time.
No I tried
idxofzero = ismember(J,indexes);
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.
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!
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?
Thank you very much m!
No one has an idea?