Update graph operations.
|
Before Width: | Height: | Size: 75 KiB After Width: | Height: | Size: 75 KiB |
|
Before Width: | Height: | Size: 76 KiB After Width: | Height: | Size: 76 KiB |
|
Before Width: | Height: | Size: 70 KiB After Width: | Height: | Size: 70 KiB |
|
Before Width: | Height: | Size: 72 KiB After Width: | Height: | Size: 72 KiB |
|
Before Width: | Height: | Size: 66 KiB After Width: | Height: | Size: 66 KiB |
|
Before Width: | Height: | Size: 65 KiB After Width: | Height: | Size: 65 KiB |
|
Before Width: | Height: | Size: 74 KiB After Width: | Height: | Size: 74 KiB |
|
Before Width: | Height: | Size: 63 KiB After Width: | Height: | Size: 63 KiB |
|
Before Width: | Height: | Size: 66 KiB After Width: | Height: | Size: 66 KiB |
|
Before Width: | Height: | Size: 63 KiB After Width: | Height: | Size: 63 KiB |
@@ -16,19 +16,19 @@ comments: true
|
||||
- **初始化**:传入 $n$ 个顶点,初始化长度为 $n$ 的顶点列表 `vertices` ,使用 $O(n)$ 时间;初始化 $n \times n$ 大小的邻接矩阵 `adjMat` ,使用 $O(n^2)$ 时间。
|
||||
|
||||
=== "初始化邻接矩阵"
|
||||

|
||||

|
||||
|
||||
=== "添加边"
|
||||

|
||||

|
||||
|
||||
=== "删除边"
|
||||

|
||||

|
||||
|
||||
=== "添加顶点"
|
||||

|
||||

|
||||
|
||||
=== "删除顶点"
|
||||

|
||||

|
||||
|
||||
以下是基于邻接矩阵表示图的实现代码。
|
||||
|
||||
@@ -179,19 +179,19 @@ comments: true
|
||||
- **初始化**:需要在邻接表中建立 $n$ 个结点和 $2m$ 条边,使用 $O(n + m)$ 时间。
|
||||
|
||||
=== "初始化邻接表"
|
||||

|
||||

|
||||
|
||||
=== "添加边"
|
||||

|
||||

|
||||
|
||||
=== "删除边"
|
||||

|
||||

|
||||
|
||||
=== "添加顶点"
|
||||

|
||||

|
||||
|
||||
=== "删除顶点"
|
||||

|
||||

|
||||
|
||||
基于邻接表实现图的代码如下所示。
|
||||
|
||||