Info

此问题已关闭。 请重新打开它进行编辑或回答。

Complexity of spconvert in matlab

1 次查看（过去 30 天）
Kris zenitis
Kris zenitis 2014-7-10
关闭： MATLAB Answer Bot 2021-8-20
Which is the complexity of spconvert function in matlab? I am trying to create the sparse representation of a sparse matrix. My matrix is the adjacency matrix of a graph. I ve got two adj_matrices. Ones with 7.000 nodes and ones with 400.000 nodes. I am using the following code:
f_adj = textread('mat.txt'); % a nx3 matrix represent the adjacency matrix nxn
adj = spconvert(f_adj);
[a b] = eigs(adj);
spy(adj);
The text file mat.txt is a nX3 files which contain the edges of the graph. What I want to ask is the complexity of the sponvert. In my 4gb ram pc I am able to create the first graph but I couldnt create the second graph.

此问题已关闭。

回答（0 个）

此问题已关闭。

标签

尚未输入任何标签。

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by