In a graph with n vertexs and e edges, the space complexity represented by the adjacency matrix is ().
A、O(n);
B、O(e);
C、O(n+e);
D、O(n*n)
发布时间：2025-09-03 23:53:21
请在 下方输入 要搜索的题目：
推荐参考答案 (
由 快搜搜题库 官方老师解答 )
答案：O(n*n)
相关试题
- 1.In a graph with n vertexs and e edges, the space complexity represented by the adjacency matrix is ()
- 2.What is the number of edges in a connected graph with n vertices?
- 3.What’s the repeated edges length of the circle{v2, v3, v6,v9,v8, v5} in the graph ( ) ? ( )
- 4.Consider a complete binary tree represented by an array [19,14,28,15,16,7,27,15,21,21,5,2][19,14,28,15,16,7,27,15,21,21,5,2
- 5.What is the time complexity of a linear queue having n elements?
- 6.What is the time complexity of a linear queue having n elements?
- 7.If A is an m×n matrix, then AAT and ATA have the same rank.
- 8.Let A be m×n matrix, if Ax = 0 has nontrivial solution, then ().
- 9.If the length of the main string is n and the length of the substring is m, then the time complexity
- 10.If G is a self complementary graph of order n, what the edge numbers of G?
