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)
发布时间：2024-09-29 11:59:15
请在 下方输入 要搜索的题目：
推荐参考答案 (
由 搜搜题库网 官方老师解答 )
答案：
相关试题
- 1.In a graph with n vertexs and e edges, the space complexity represented by the adjacency matrix is ()
- 2.In the adjacency matrix of an undirected graph with n vertexs and e edges, the number of zero elements
- 3.What is the number of edges in a connected graph with n vertices?
- 4.What is the number of edges in a connected graph with n vertices?
- 5.Let A is m×n matrix, B is p×q matrix, the condition of the multiplication of A times B is ().
- 6.Let A be m×n matrix, if Ax = 0 has nontrivial solution, then ().
- 7.H a n p o W JI o n H e I e n e M o e n 6 a 6 y W K e
- 8.There are m factories, s transfer stations, and n markets in a transshipment problem.
- 9.C h oo s e t h e w o r d o r ph r a s e t h a t c a n r e p l a c e t h e u nd e r li n e d p a r t i
- 10.C h oo s e t h e w o r d o r ph r a s e t h a t c a n r e p l a c e t h e u nd e r li n e d p a r t i
