what is the time complexity of generating n dimensional adjacency matrix in matlab.
Show older comments
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.
Accepted Answer
Walter Roberson
on 30 Jan 2016
1 vote
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.
More Answers (0)
Categories
Find more on Creating and Concatenating Matrices in Help Center and File Exchange
on 30 Jan 2016
on 30 Jan 2016
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
