xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-26 02:06:30 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fix graph_operations.md and binary_tree_traversal.md

Browse source
This commit is contained in:
krahets 2023-02-15 03:43:29 +08:00
parent 113450dc93
commit 9848881945
2 changed files with 3 additions and 23 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
docs/chapter_graph/graph_operations.md
View file

@ -128,80 +128,60 @@ comments: true
=== "Java" === "Java"
```java title="graph_adjacency_list.java" ```java title="graph_adjacency_list.java"
[class]{Vertex}-[func]{}
[class]{GraphAdjList}-[func]{} [class]{GraphAdjList}-[func]{}
``` ```
=== "C++" === "C++"
```cpp title="graph_adjacency_list.cpp" ```cpp title="graph_adjacency_list.cpp"
[class]{Vertex}-[func]{}
[class]{GraphAdjList}-[func]{} [class]{GraphAdjList}-[func]{}
``` ```
=== "Python" === "Python"
```python title="graph_adjacency_list.py" ```python title="graph_adjacency_list.py"
[class]{Vertex}-[func]{}
[class]{GraphAdjList}-[func]{} [class]{GraphAdjList}-[func]{}
``` ```
=== "Go" === "Go"
```go title="graph_adjacency_list.go" ```go title="graph_adjacency_list.go"
[class]{vertex}-[func]{}
[class]{graphAdjList}-[func]{} [class]{graphAdjList}-[func]{}
``` ```
=== "JavaScript" === "JavaScript"
```javascript title="graph_adjacency_list.js" ```javascript title="graph_adjacency_list.js"
[class]{Vertex}-[func]{}
[class]{GraphAdjList}-[func]{} [class]{GraphAdjList}-[func]{}
``` ```
=== "TypeScript" === "TypeScript"
```typescript title="graph_adjacency_list.ts" ```typescript title="graph_adjacency_list.ts"
[class]{Vertex}-[func]{}
[class]{GraphAdjList}-[func]{} [class]{GraphAdjList}-[func]{}
``` ```
=== "C" === "C"
```c title="graph_adjacency_list.c" ```c title="graph_adjacency_list.c"
[class]{vertex}-[func]{}
[class]{graphAdjList}-[func]{} [class]{graphAdjList}-[func]{}
``` ```
=== "C#" === "C#"
```csharp title="graph_adjacency_list.cs" ```csharp title="graph_adjacency_list.cs"
[class]{Vertex}-[func]{}
[class]{GraphAdjList}-[func]{} [class]{GraphAdjList}-[func]{}
``` ```
=== "Swift" === "Swift"
```swift title="graph_adjacency_list.swift" ```swift title="graph_adjacency_list.swift"
[class]{Vertex}-[func]{}
[class]{GraphAdjList}-[func]{} [class]{GraphAdjList}-[func]{}
``` ```
=== "Zig" === "Zig"
```zig title="graph_adjacency_list.zig" ```zig title="graph_adjacency_list.zig"
[class]{Vertex}-[func]{}
[class]{GraphAdjList}-[func]{} [class]{GraphAdjList}-[func]{}
``` ```

4
docs/chapter_tree/binary_tree_traversal.md
View file

@ -18,7 +18,7 @@ comments: true
<p align="center"> Fig. 二叉树的层序遍历 </p> <p align="center"> Fig. 二叉树的层序遍历 </p>
### 实现代码 ### 算法实现
广度优先遍历一般借助「队列」来实现。队列的规则是“先进先出”，广度优先遍历的规则是 ”一层层平推“ ，两者背后的思想是一致的。 广度优先遍历一般借助「队列」来实现。队列的规则是“先进先出”，广度优先遍历的规则是 ”一层层平推“ ，两者背后的思想是一致的。
@ -108,7 +108,7 @@ comments: true
</div> </div>
### 实现代码 ### 算法实现
=== "Java" === "Java"