408/2022-WangDao-CS-DS-Notes
1
0
Fork 0
mirror of https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes.git synced 2026-02-02 18:29:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 6.2图的存储结构.md

Browse Source
This commit is contained in:
岩岩
2022-03-29 11:37:14 +08:00
committed by GitHub
parent cac8ce2452
commit ccf1c357e5
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
6.2图的存储结构.md
View File

@@ -7,7 +7,7 @@
③十字链表：链式存储（存储有向图）
④邻接多重表：链式存储（存储无向图）
![1637936258196](F:\408数据结构\图片\1637936258196.png)
![1637936258196](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1637936258196.png)
### 二、邻接矩阵法
@@ -22,7 +22,7 @@
#### 1.1普通图的领接矩阵法：
![1637846244394](F:\408数据结构\图片\1637846244394.png)
![1637846244394](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1637846244394.png)
```c
#define MaxVertexNum 100 //顶点数目最大值
@@ -51,7 +51,7 @@ typedef struct{
#### 2.带权图的领接矩阵法
![1637848061168](F:\408数据结构\图片\1637848061168.png)
![1637848061168](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1637848061168.png)
```c
#define MaxVertexNum 100 //顶点数目最大值
@@ -78,7 +78,7 @@ typedef struct{
与树的孩子表示法很像
![1637934445539](F:\408数据结构\图片\1637934445539.jpg)
![1637934445539](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1637934445539.jpg)
```c
#define MaxVertexNum 100 //顶点数目最大值
@@ -106,7 +106,7 @@ typedef struct{
解决了邻接表法的找入边难的问题。
![1637936499284](F:\408数据结构\图片\1637936499284.png)
![1637936499284](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1637936499284.png)
### 五、邻接多重表
@@ -116,5 +116,5 @@ typedef struct{
删除边、删除结点等操作很方便。
![1637936777739](F:\408数据结构\图片\1637936777739.png)
![1637936777739](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1637936777739.png)