文件名称:G2D
-
所属分类:
- 标签属性:
- 上传时间:2017-12-05
-
文件大小:3kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
逻辑结构分为两部分:V和E集合。因此,用一个一维数组存放图中所有顶点数据;用一个二维数组存放顶点间关系(边或弧)的数据,这个二维数组称为邻接矩阵。邻接矩阵又分为有向图邻接矩阵和无向图邻接矩阵(The logical structure is divided into two parts: the V and the E set. Therefore, a one-dimensional array is used to store all the vertex data in the graph, and a two-dimensional array is used to store the data of the vertex relations (edges or arcs). The two-dimensional array is called the adjacency matrix. Adjacency matrix is also divided into directed graph adjacency matrix and undirected graph adjacency matrix)
相关搜索: 邻接矩阵计算
(系统自动生成,下载前可以参看下载内容)
下载文件列表
文件名 | 大小 | 更新时间 |
---|---|---|
m.m | 9237 | 2017-12-04 |
LEN.m | 132 | 2017-11-29 |
G2D.m | 5027 | 2017-12-04 |
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.