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

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.

Answer 1

[Walter Roberson]

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.