邻接矩阵



;_numbers.svg2217.png")
邻接矩阵是表示一个图的常用存储表示。它用两个数组分别存储数据元素(顶点)的信息和数据元素之间的关系(边或弧)的信息。
距离矩阵可算是邻接矩阵的扩充。
阶为的图
的邻接矩阵
是
的。将
的顶点标签为
。若
,
,否则
。
无向图的邻接矩阵是对称矩阵。
单词 | Adjacency matrix |
释义 |
Adjacency matrix
中文百科
邻接矩阵![]() ![]() ![]() ![]() 邻接矩阵是表示一个图的常用存储表示。它用两个数组分别存储数据元素(顶点)的信息和数据元素之间的关系(边或弧)的信息。 距离矩阵可算是邻接矩阵的扩充。 阶为 无向图的邻接矩阵是对称矩阵。
英语百科
Adjacency matrix 邻接矩阵![]() ![]() ![]() ![]() In graph theory, computer science and application areas such as sociology, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph. In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected, the adjacency matrix is symmetric. The relationship between a graph and the eigenvalues and eigenvectors of its adjacency matrix is studied in spectral graph theory. |
随便看 |
|
英汉双解词典包含3607232条英汉词条,基本涵盖了全部常用单词的翻译及用法,是英语学习的有利工具。