CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 10:09:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2024-01-12 21:14:29 +08:00
parent 2979889781
commit 6dc2b9eabe
21 changed files with 73 additions and 103 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
chapter_graph/graph_operations/index.html
View File

@@ -3532,7 +3532,7 @@
<!-- Page content -->
<h1 id="92">9.2 &nbsp; 图基础操作<a class="headerlink" href="#92" title="Permanent link">&para;</a></h1>
<h1 id="92">9.2 &nbsp; 图的基础操作<a class="headerlink" href="#92" title="Permanent link">&para;</a></h1>
<p>图的基础操作可分为对“边”的操作和对“顶点”的操作。在“邻接矩阵”和“邻接表”两种表示方法下，实现方式有所不同。</p>
<h2 id="921">9.2.1 &nbsp; 基于邻接矩阵的实现<a class="headerlink" href="#921" title="Permanent link">&para;</a></h2>
<p>给定一个顶点数量为 <span class="arithmatex">\(n\)</span> 的无向图，则各种操作的实现方式如图 9-7 所示。</p>