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

3 次查看（过去 30 天）
Pallavi Jain
Pallavi Jain 2016-1-30
回答： 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.

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

采纳的回答

Walter Roberson
Walter Roberson 2016-1-30
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.

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Matrices and Arrays 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by