From ccf1c357e59ff2aa858ca7e3d0bc9d0482b29130 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E5=B2=A9=E5=B2=A9?= <68364461+oxyanyano@users.noreply.github.com> Date: Tue, 29 Mar 2022 11:37:14 +0800 Subject: [PATCH] =?UTF-8?q?Update=206.2=E5=9B=BE=E7=9A=84=E5=AD=98?= =?UTF-8?q?=E5=82=A8=E7=BB=93=E6=9E=84.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- 6.2图的存储结构.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/6.2图的存储结构.md b/6.2图的存储结构.md index 6868474..a9de8b4 100644 --- a/6.2图的存储结构.md +++ b/6.2图的存储结构.md @@ -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)