what is the time complexity of generating n dimensional adjacency matrix in matlab.

Question

Pallavi Jain 2016-1-30

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/265866-what-is-the-time-complexity-of-generating-n-dimensional-adjacency-matrix-in-matlab

回答： Walter Roberson 2016-1-30

what is the time complexity of generating n dimensional adjacency matrix in matlab using standard functions as zeros,ones,eye,etc... Is it n^2.

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Walter Roberson 2016-1-30

1
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/265866-what-is-the-time-complexity-of-generating-n-dimensional-adjacency-matrix-in-matlab#answer_207944

No, but it might be something to the power of n, since you have n dimensions. Difficult to say as I am only familiar with 2 dimensional adjacency matrices for n vertices, not with an n dimensional adjacency matrix.

The computational complexity of a normal adjacency matrix can be the number of vertices times the maximum degree in some representations, depending in part on what the input representation is.