algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Sort the coding languages by applications. (#721)

Browse Source
This commit is contained in:
Yudong Jin
2023-09-04 03:19:08 +08:00
committed by GitHub
parent 8d5e84f70a
commit 9c3b7b6422
55 changed files with 6826 additions and 6826 deletions
Download Patch File Download Diff File Expand all files Collapse all files

112
docs/chapter_graph/graph_operations.md
View File

@@ -28,9 +28,9 @@
以下是基于邻接矩阵表示图的实现代码。
=== "Java"
=== "Python"
```java title="graph_adjacency_matrix.java"
```python title="graph_adjacency_matrix.py"
[class]{GraphAdjMat}-[func]{}
```
@@ -40,9 +40,15 @@
[class]{GraphAdjMat}-[func]{}
```
=== "Python"
=== "Java"
```python title="graph_adjacency_matrix.py"
```java title="graph_adjacency_matrix.java"
[class]{GraphAdjMat}-[func]{}
```
=== "C#"
```csharp title="graph_adjacency_matrix.cs"
[class]{GraphAdjMat}-[func]{}
```
@@ -52,6 +58,12 @@
[class]{graphAdjMat}-[func]{}
```
=== "Swift"
```swift title="graph_adjacency_matrix.swift"
[class]{GraphAdjMat}-[func]{}
```
=== "JS"
```javascript title="graph_adjacency_matrix.js"
@@ -64,30 +76,6 @@
[class]{GraphAdjMat}-[func]{}
```
=== "C"
```c title="graph_adjacency_matrix.c"
[class]{graphAdjMat}-[func]{}
```
=== "C#"
```csharp title="graph_adjacency_matrix.cs"
[class]{GraphAdjMat}-[func]{}
```
=== "Swift"
```swift title="graph_adjacency_matrix.swift"
[class]{GraphAdjMat}-[func]{}
```
=== "Zig"
```zig title="graph_adjacency_matrix.zig"
```
=== "Dart"
```dart title="graph_adjacency_matrix.dart"
@@ -100,6 +88,18 @@
[class]{GraphAdjMat}-[func]{}
```
=== "C"
```c title="graph_adjacency_matrix.c"
[class]{graphAdjMat}-[func]{}
```
=== "Zig"
```zig title="graph_adjacency_matrix.zig"
```
## 基于邻接表的实现
设无向图的顶点总数为 $n$、边总数为 $m$ ，则可根据下图所示的方法实现各种操作。
@@ -131,9 +131,9 @@
2. 如果类似邻接矩阵那样，使用顶点列表索引来区分不同顶点。那么，假设我们想要删除索引为 $i$ 的顶点，则需要遍历整个邻接表，将其中 $> i$ 的索引全部减 $1$ ，这样操作效率较低。
3. 因此我们考虑引入顶点类 `Vertex` ，使得每个顶点都是唯一的对象，此时删除顶点时就无须改动其余顶点了。
=== "Java"
=== "Python"
```java title="graph_adjacency_list.java"
```python title="graph_adjacency_list.py"
[class]{GraphAdjList}-[func]{}
```
@@ -143,9 +143,15 @@
[class]{GraphAdjList}-[func]{}
```
=== "Python"
=== "Java"
```python title="graph_adjacency_list.py"
```java title="graph_adjacency_list.java"
[class]{GraphAdjList}-[func]{}
```
=== "C#"
```csharp title="graph_adjacency_list.cs"
[class]{GraphAdjList}-[func]{}
```
@@ -155,6 +161,12 @@
[class]{graphAdjList}-[func]{}
```
=== "Swift"
```swift title="graph_adjacency_list.swift"
[class]{GraphAdjList}-[func]{}
```
=== "JS"
```javascript title="graph_adjacency_list.js"
@@ -167,30 +179,6 @@
[class]{GraphAdjList}-[func]{}
```
=== "C"
```c title="graph_adjacency_list.c"
[class]{graphAdjList}-[func]{}
```
=== "C#"
```csharp title="graph_adjacency_list.cs"
[class]{GraphAdjList}-[func]{}
```
=== "Swift"
```swift title="graph_adjacency_list.swift"
[class]{GraphAdjList}-[func]{}
```
=== "Zig"
```zig title="graph_adjacency_list.zig"
[class]{GraphAdjList}-[func]{}
```
=== "Dart"
```dart title="graph_adjacency_list.dart"
@@ -203,6 +191,18 @@
[class]{GraphAdjList}-[func]{}
```
=== "C"
```c title="graph_adjacency_list.c"
[class]{graphAdjList}-[func]{}
```
=== "Zig"
```zig title="graph_adjacency_list.zig"
[class]{GraphAdjList}-[func]{}
```
## 效率对比
设图中共有 $n$ 个顶点和 $m$ 条边，下表对比了邻接矩阵和邻接表的时间和空间效率。

140
docs/chapter_graph/graph_traversal.md
View File

@@ -20,10 +20,10 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
为了防止重复遍历顶点，我们需要借助一个哈希表 `visited` 来记录哪些节点已被访问。
=== "Java"
=== "Python"
```java title="graph_bfs.java"
[class]{graph_bfs}-[func]{graphBFS}
```python title="graph_bfs.py"
[class]{}-[func]{graph_bfs}
```
=== "C++"
@@ -32,10 +32,16 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
[class]{}-[func]{graphBFS}
```
=== "Python"
=== "Java"
```python title="graph_bfs.py"
[class]{}-[func]{graph_bfs}
```java title="graph_bfs.java"
[class]{graph_bfs}-[func]{graphBFS}
```
=== "C#"
```csharp title="graph_bfs.cs"
[class]{graph_bfs}-[func]{graphBFS}
```
=== "Go"
@@ -44,6 +50,12 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
[class]{}-[func]{graphBFS}
```
=== "Swift"
```swift title="graph_bfs.swift"
[class]{}-[func]{graphBFS}
```
=== "JS"
```javascript title="graph_bfs.js"
@@ -56,30 +68,6 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
[class]{}-[func]{graphBFS}
```
=== "C"
```c title="graph_bfs.c"
[class]{}-[func]{graphBFS}
```
=== "C#"
```csharp title="graph_bfs.cs"
[class]{graph_bfs}-[func]{graphBFS}
```
=== "Swift"
```swift title="graph_bfs.swift"
[class]{}-[func]{graphBFS}
```
=== "Zig"
```zig title="graph_bfs.zig"
[class]{}-[func]{graphBFS}
```
=== "Dart"
```dart title="graph_bfs.dart"
@@ -92,6 +80,18 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
[class]{}-[func]{graph_bfs}
```
=== "C"
```c title="graph_bfs.c"
[class]{}-[func]{graphBFS}
```
=== "Zig"
```zig title="graph_bfs.zig"
[class]{}-[func]{graphBFS}
```
代码相对抽象，建议对照下图来加深理解。
=== "<1>"
@@ -147,12 +147,12 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
这种“走到尽头再返回”的算法范式通常基于递归来实现。与广度优先遍历类似，在深度优先遍历中我们也需要借助一个哈希表 `visited` 来记录已被访问的顶点，以避免重复访问顶点。
=== "Java"
=== "Python"
```java title="graph_dfs.java"
[class]{graph_dfs}-[func]{dfs}
```python title="graph_dfs.py"
[class]{}-[func]{dfs}
[class]{graph_dfs}-[func]{graphDFS}
[class]{}-[func]{graph_dfs}
```
=== "C++"
@@ -163,12 +163,20 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
[class]{}-[func]{graphDFS}
```
=== "Python"
=== "Java"
```python title="graph_dfs.py"
[class]{}-[func]{dfs}
```java title="graph_dfs.java"
[class]{graph_dfs}-[func]{dfs}
[class]{}-[func]{graph_dfs}
[class]{graph_dfs}-[func]{graphDFS}
```
=== "C#"
```csharp title="graph_dfs.cs"
[class]{graph_dfs}-[func]{dfs}
[class]{graph_dfs}-[func]{graphDFS}
```
=== "Go"
@@ -179,6 +187,14 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
[class]{}-[func]{graphDFS}
```
=== "Swift"
```swift title="graph_dfs.swift"
[class]{}-[func]{dfs}
[class]{}-[func]{graphDFS}
```
=== "JS"
```javascript title="graph_dfs.js"
@@ -195,38 +211,6 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
[class]{}-[func]{graphDFS}
```
=== "C"
```c title="graph_dfs.c"
[class]{}-[func]{dfs}
[class]{}-[func]{graphDFS}
```
=== "C#"
```csharp title="graph_dfs.cs"
[class]{graph_dfs}-[func]{dfs}
[class]{graph_dfs}-[func]{graphDFS}
```
=== "Swift"
```swift title="graph_dfs.swift"
[class]{}-[func]{dfs}
[class]{}-[func]{graphDFS}
```
=== "Zig"
```zig title="graph_dfs.zig"
[class]{}-[func]{dfs}
[class]{}-[func]{graphDFS}
```
=== "Dart"
```dart title="graph_dfs.dart"
@@ -243,6 +227,22 @@ BFS 通常借助队列来实现。队列具有“先入先出”的性质，这
[class]{}-[func]{graph_dfs}
```
=== "C"
```c title="graph_dfs.c"
[class]{}-[func]{dfs}
[class]{}-[func]{graphDFS}
```
=== "Zig"
```zig title="graph_dfs.zig"
[class]{}-[func]{dfs}
[class]{}-[func]{graphDFS}
```
深度优先遍历的算法流程如下图所示。
- **直虚线代表向下递推**，表示开启了一个新的递归方法来访问新顶点。