问题:
[单选题]The graph G contains n vertices (n>0), implemented with an adjacency matrix. How many items have been added to the adjacency matrix after adding a new vertex?图G包含n个顶点(n>0),用邻接矩阵实现。在其中加入一个新的顶点后邻接矩阵增加了多少项?
An+1
B2n
C2n-1
D2n+1
Copyright © 2024 www.daanwo.com All Rights Reserved |