mirror of
https://github.com/krahets/hello-algo.git
synced 2026-09-22 22:36:35 +08:00
feat: Traditional Chinese version (#1163)
* First commit * Update mkdocs.yml * Translate all the docs to traditional Chinese * Translate the code files. * Translate the docker file * Fix mkdocs.yml * Translate all the figures from SC to TC * 二叉搜尋樹 -> 二元搜尋樹 * Update terminology. * Update terminology * 构造函数/构造方法 -> 建構子 异或 -> 互斥或 * 擴充套件 -> 擴展 * constant - 常量 - 常數 * 類 -> 類別 * AVL -> AVL 樹 * 數組 -> 陣列 * 係統 -> 系統 斐波那契數列 -> 費波那契數列 運算元量 -> 運算量 引數 -> 參數 * 聯絡 -> 關聯 * 麵試 -> 面試 * 面向物件 -> 物件導向 歸併排序 -> 合併排序 范式 -> 範式 * Fix 算法 -> 演算法 * 錶示 -> 表示 反碼 -> 一補數 補碼 -> 二補數 列列尾部 -> 佇列尾部 區域性性 -> 區域性 一摞 -> 一疊 * Synchronize with main branch * 賬號 -> 帳號 推匯 -> 推導 * Sync with main branch * First commit * Update mkdocs.yml * Translate all the docs to traditional Chinese * Translate the code files. * Translate the docker file * Fix mkdocs.yml * Translate all the figures from SC to TC * 二叉搜尋樹 -> 二元搜尋樹 * Update terminology * 构造函数/构造方法 -> 建構子 异或 -> 互斥或 * 擴充套件 -> 擴展 * constant - 常量 - 常數 * 類 -> 類別 * AVL -> AVL 樹 * 數組 -> 陣列 * 係統 -> 系統 斐波那契數列 -> 費波那契數列 運算元量 -> 運算量 引數 -> 參數 * 聯絡 -> 關聯 * 麵試 -> 面試 * 面向物件 -> 物件導向 歸併排序 -> 合併排序 范式 -> 範式 * Fix 算法 -> 演算法 * 錶示 -> 表示 反碼 -> 一補數 補碼 -> 二補數 列列尾部 -> 佇列尾部 區域性性 -> 區域性 一摞 -> 一疊 * Synchronize with main branch * 賬號 -> 帳號 推匯 -> 推導 * Sync with main branch * Update terminology.md * 操作数量（num. of operations）-> 操作數量 * 字首和->前綴和 * Update figures * 歸 -> 迴 記憶體洩漏 -> 記憶體流失 * Fix the bug of the file filter * 支援 -> 支持 Add zh-Hant/README.md * Add the zh-Hant chapter covers. Bug fixes. * 外掛 -> 擴充功能 * Add the landing page for zh-Hant version * Unify the font of the chapter covers for the zh, en, and zh-Hant version * Move zh-Hant/ to zh-hant/ * Translate terminology.md to traditional Chinese
This commit is contained in:
Yudong Jin
@@ -0,0 +1,100 @@
|
||||
// File: graph_adjacency_list.go
|
||||
// Created Time: 2023-01-31
|
||||
// Author: Reanon (793584285@qq.com)
|
||||
|
||||
package chapter_graph
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"strconv"
|
||||
"strings"
|
||||
|
||||
. "github.com/krahets/hello-algo/pkg"
|
||||
)
|
||||
|
||||
/* 基於鄰接表實現的無向圖類別 */
|
||||
type graphAdjList struct {
|
||||
// 鄰接表，key：頂點，value：該頂點的所有鄰接頂點
|
||||
adjList map[Vertex][]Vertex
|
||||
}
|
||||
|
||||
/* 建構子 */
|
||||
func newGraphAdjList(edges [][]Vertex) *graphAdjList {
|
||||
g := &graphAdjList{
|
||||
adjList: make(map[Vertex][]Vertex),
|
||||
}
|
||||
// 新增所有頂點和邊
|
||||
for _, edge := range edges {
|
||||
g.addVertex(edge[0])
|
||||
g.addVertex(edge[1])
|
||||
g.addEdge(edge[0], edge[1])
|
||||
}
|
||||
return g
|
||||
}
|
||||
|
||||
/* 獲取頂點數量 */
|
||||
func (g *graphAdjList) size() int {
|
||||
return len(g.adjList)
|
||||
}
|
||||
|
||||
/* 新增邊 */
|
||||
func (g *graphAdjList) addEdge(vet1 Vertex, vet2 Vertex) {
|
||||
_, ok1 := g.adjList[vet1]
|
||||
_, ok2 := g.adjList[vet2]
|
||||
if !ok1 || !ok2 || vet1 == vet2 {
|
||||
panic("error")
|
||||
}
|
||||
// 新增邊 vet1 - vet2, 新增匿名 struct{},
|
||||
g.adjList[vet1] = append(g.adjList[vet1], vet2)
|
||||
g.adjList[vet2] = append(g.adjList[vet2], vet1)
|
||||
}
|
||||
|
||||
/* 刪除邊 */
|
||||
func (g *graphAdjList) removeEdge(vet1 Vertex, vet2 Vertex) {
|
||||
_, ok1 := g.adjList[vet1]
|
||||
_, ok2 := g.adjList[vet2]
|
||||
if !ok1 || !ok2 || vet1 == vet2 {
|
||||
panic("error")
|
||||
}
|
||||
// 刪除邊 vet1 - vet2
|
||||
g.adjList[vet1] = DeleteSliceElms(g.adjList[vet1], vet2)
|
||||
g.adjList[vet2] = DeleteSliceElms(g.adjList[vet2], vet1)
|
||||
}
|
||||
|
||||
/* 新增頂點 */
|
||||
func (g *graphAdjList) addVertex(vet Vertex) {
|
||||
_, ok := g.adjList[vet]
|
||||
if ok {
|
||||
return
|
||||
}
|
||||
// 在鄰接表中新增一個新鏈結串列
|
||||
g.adjList[vet] = make([]Vertex, 0)
|
||||
}
|
||||
|
||||
/* 刪除頂點 */
|
||||
func (g *graphAdjList) removeVertex(vet Vertex) {
|
||||
_, ok := g.adjList[vet]
|
||||
if !ok {
|
||||
panic("error")
|
||||
}
|
||||
// 在鄰接表中刪除頂點 vet 對應的鏈結串列
|
||||
delete(g.adjList, vet)
|
||||
// 走訪其他頂點的鏈結串列，刪除所有包含 vet 的邊
|
||||
for v, list := range g.adjList {
|
||||
g.adjList[v] = DeleteSliceElms(list, vet)
|
||||
}
|
||||
}
|
||||
|
||||
/* 列印鄰接表 */
|
||||
func (g *graphAdjList) print() {
|
||||
var builder strings.Builder
|
||||
fmt.Printf("鄰接表 = \n")
|
||||
for k, v := range g.adjList {
|
||||
builder.WriteString("\t\t" + strconv.Itoa(k.Val) + ": ")
|
||||
for _, vet := range v {
|
||||
builder.WriteString(strconv.Itoa(vet.Val) + " ")
|
||||
}
|
||||
fmt.Println(builder.String())
|
||||
builder.Reset()
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,45 @@
|
||||
// File: graph_adjacency_list_test.go
|
||||
// Created Time: 2023-01-31
|
||||
// Author: Reanon (793584285@qq.com)
|
||||
|
||||
package chapter_graph
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"testing"
|
||||
|
||||
. "github.com/krahets/hello-algo/pkg"
|
||||
)
|
||||
|
||||
func TestGraphAdjList(t *testing.T) {
|
||||
/* 初始化無向圖 */
|
||||
v := ValsToVets([]int{1, 3, 2, 5, 4})
|
||||
edges := [][]Vertex{{v[0], v[1]}, {v[0], v[3]}, {v[1], v[2]}, {v[2], v[3]}, {v[2], v[4]}, {v[3], v[4]}}
|
||||
graph := newGraphAdjList(edges)
|
||||
fmt.Println("初始化後，圖為:")
|
||||
graph.print()
|
||||
|
||||
/* 新增邊 */
|
||||
// 頂點 1, 2 即 v[0], v[2]
|
||||
graph.addEdge(v[0], v[2])
|
||||
fmt.Println("\n新增邊 1-2 後，圖為")
|
||||
graph.print()
|
||||
|
||||
/* 刪除邊 */
|
||||
// 頂點 1, 3 即 v[0], v[1]
|
||||
graph.removeEdge(v[0], v[1])
|
||||
fmt.Println("\n刪除邊 1-3 後，圖為")
|
||||
graph.print()
|
||||
|
||||
/* 新增頂點 */
|
||||
v5 := NewVertex(6)
|
||||
graph.addVertex(v5)
|
||||
fmt.Println("\n新增頂點 6 後，圖為")
|
||||
graph.print()
|
||||
|
||||
/* 刪除頂點 */
|
||||
// 頂點 3 即 v[1]
|
||||
graph.removeVertex(v[1])
|
||||
fmt.Println("\n刪除頂點 3 後，圖為")
|
||||
graph.print()
|
||||
}
|
||||
@@ -0,0 +1,102 @@
|
||||
// File: graph_adjacency_matrix.go
|
||||
// Created Time: 2023-01-31
|
||||
// Author: Reanon (793584285@qq.com)
|
||||
|
||||
package chapter_graph
|
||||
|
||||
import "fmt"
|
||||
|
||||
/* 基於鄰接矩陣實現的無向圖類別 */
|
||||
type graphAdjMat struct {
|
||||
// 頂點串列，元素代表“頂點值”，索引代表“頂點索引”
|
||||
vertices []int
|
||||
// 鄰接矩陣，行列索引對應“頂點索引”
|
||||
adjMat [][]int
|
||||
}
|
||||
|
||||
/* 建構子 */
|
||||
func newGraphAdjMat(vertices []int, edges [][]int) *graphAdjMat {
|
||||
// 新增頂點
|
||||
n := len(vertices)
|
||||
adjMat := make([][]int, n)
|
||||
for i := range adjMat {
|
||||
adjMat[i] = make([]int, n)
|
||||
}
|
||||
// 初始化圖
|
||||
g := &graphAdjMat{
|
||||
vertices: vertices,
|
||||
adjMat: adjMat,
|
||||
}
|
||||
// 新增邊
|
||||
// 請注意，edges 元素代表頂點索引，即對應 vertices 元素索引
|
||||
for i := range edges {
|
||||
g.addEdge(edges[i][0], edges[i][1])
|
||||
}
|
||||
return g
|
||||
}
|
||||
|
||||
/* 獲取頂點數量 */
|
||||
func (g *graphAdjMat) size() int {
|
||||
return len(g.vertices)
|
||||
}
|
||||
|
||||
/* 新增頂點 */
|
||||
func (g *graphAdjMat) addVertex(val int) {
|
||||
n := g.size()
|
||||
// 向頂點串列中新增新頂點的值
|
||||
g.vertices = append(g.vertices, val)
|
||||
// 在鄰接矩陣中新增一行
|
||||
newRow := make([]int, n)
|
||||
g.adjMat = append(g.adjMat, newRow)
|
||||
// 在鄰接矩陣中新增一列
|
||||
for i := range g.adjMat {
|
||||
g.adjMat[i] = append(g.adjMat[i], 0)
|
||||
}
|
||||
}
|
||||
|
||||
/* 刪除頂點 */
|
||||
func (g *graphAdjMat) removeVertex(index int) {
|
||||
if index >= g.size() {
|
||||
return
|
||||
}
|
||||
// 在頂點串列中移除索引 index 的頂點
|
||||
g.vertices = append(g.vertices[:index], g.vertices[index+1:]...)
|
||||
// 在鄰接矩陣中刪除索引 index 的行
|
||||
g.adjMat = append(g.adjMat[:index], g.adjMat[index+1:]...)
|
||||
// 在鄰接矩陣中刪除索引 index 的列
|
||||
for i := range g.adjMat {
|
||||
g.adjMat[i] = append(g.adjMat[i][:index], g.adjMat[i][index+1:]...)
|
||||
}
|
||||
}
|
||||
|
||||
/* 新增邊 */
|
||||
// 參數 i, j 對應 vertices 元素索引
|
||||
func (g *graphAdjMat) addEdge(i, j int) {
|
||||
// 索引越界與相等處理
|
||||
if i < 0 || j < 0 || i >= g.size() || j >= g.size() || i == j {
|
||||
fmt.Errorf("%s", "Index Out Of Bounds Exception")
|
||||
}
|
||||
// 在無向圖中，鄰接矩陣關於主對角線對稱，即滿足 (i, j) == (j, i)
|
||||
g.adjMat[i][j] = 1
|
||||
g.adjMat[j][i] = 1
|
||||
}
|
||||
|
||||
/* 刪除邊 */
|
||||
// 參數 i, j 對應 vertices 元素索引
|
||||
func (g *graphAdjMat) removeEdge(i, j int) {
|
||||
// 索引越界與相等處理
|
||||
if i < 0 || j < 0 || i >= g.size() || j >= g.size() || i == j {
|
||||
fmt.Errorf("%s", "Index Out Of Bounds Exception")
|
||||
}
|
||||
g.adjMat[i][j] = 0
|
||||
g.adjMat[j][i] = 0
|
||||
}
|
||||
|
||||
/* 列印鄰接矩陣 */
|
||||
func (g *graphAdjMat) print() {
|
||||
fmt.Printf("\t頂點串列 = %v\n", g.vertices)
|
||||
fmt.Printf("\t鄰接矩陣 = \n")
|
||||
for i := range g.adjMat {
|
||||
fmt.Printf("\t\t\t%v\n", g.adjMat[i])
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,43 @@
|
||||
// File: graph_adjacency_matrix_test.go
|
||||
// Created Time: 2023-01-31
|
||||
// Author: Reanon (793584285@qq.com)
|
||||
|
||||
package chapter_graph
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"testing"
|
||||
)
|
||||
|
||||
func TestGraphAdjMat(t *testing.T) {
|
||||
/* 初始化無向圖 */
|
||||
// 請注意，edges 元素代表頂點索引，即對應 vertices 元素索引
|
||||
vertices := []int{1, 3, 2, 5, 4}
|
||||
edges := [][]int{{0, 1}, {1, 2}, {2, 3}, {0, 3}, {2, 4}, {3, 4}}
|
||||
graph := newGraphAdjMat(vertices, edges)
|
||||
fmt.Println("初始化後，圖為:")
|
||||
graph.print()
|
||||
|
||||
/* 新增邊 */
|
||||
// 頂點 1, 2 的索引分別為 0, 2
|
||||
graph.addEdge(0, 2)
|
||||
fmt.Println("新增邊 1-2 後，圖為")
|
||||
graph.print()
|
||||
|
||||
/* 刪除邊 */
|
||||
// 頂點 1, 3 的索引分別為 0, 1
|
||||
graph.removeEdge(0, 1)
|
||||
fmt.Println("刪除邊 1-3 後，圖為")
|
||||
graph.print()
|
||||
|
||||
/* 新增頂點 */
|
||||
graph.addVertex(6)
|
||||
fmt.Println("新增頂點 6 後，圖為")
|
||||
graph.print()
|
||||
|
||||
/* 刪除頂點 */
|
||||
// 頂點 3 的索引為 1
|
||||
graph.removeVertex(1)
|
||||
fmt.Println("刪除頂點 3 後，圖為")
|
||||
graph.print()
|
||||
}
|
||||
@@ -0,0 +1,41 @@
|
||||
// File: graph_bfs.go
|
||||
// Created Time: 2023-02-18
|
||||
// Author: Reanon (793584285@qq.com)
|
||||
|
||||
package chapter_graph
|
||||
|
||||
import (
|
||||
. "github.com/krahets/hello-algo/pkg"
|
||||
)
|
||||
|
||||
/* 廣度優先走訪 */
|
||||
// 使用鄰接表來表示圖，以便獲取指定頂點的所有鄰接頂點
|
||||
func graphBFS(g *graphAdjList, startVet Vertex) []Vertex {
|
||||
// 頂點走訪序列
|
||||
res := make([]Vertex, 0)
|
||||
// 雜湊表，用於記錄已被訪問過的頂點
|
||||
visited := make(map[Vertex]struct{})
|
||||
visited[startVet] = struct{}{}
|
||||
// 佇列用於實現 BFS, 使用切片模擬佇列
|
||||
queue := make([]Vertex, 0)
|
||||
queue = append(queue, startVet)
|
||||
// 以頂點 vet 為起點，迴圈直至訪問完所有頂點
|
||||
for len(queue) > 0 {
|
||||
// 佇列首頂點出隊
|
||||
vet := queue[0]
|
||||
queue = queue[1:]
|
||||
// 記錄訪問頂點
|
||||
res = append(res, vet)
|
||||
// 走訪該頂點的所有鄰接頂點
|
||||
for _, adjVet := range g.adjList[vet] {
|
||||
_, isExist := visited[adjVet]
|
||||
// 只入列未訪問的頂點
|
||||
if !isExist {
|
||||
queue = append(queue, adjVet)
|
||||
visited[adjVet] = struct{}{}
|
||||
}
|
||||
}
|
||||
}
|
||||
// 返回頂點走訪序列
|
||||
return res
|
||||
}
|
||||
@@ -0,0 +1,29 @@
|
||||
// File: graph_bfs_test.go
|
||||
// Created Time: 2023-02-18
|
||||
// Author: Reanon (793584285@qq.com)
|
||||
|
||||
package chapter_graph
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"testing"
|
||||
|
||||
. "github.com/krahets/hello-algo/pkg"
|
||||
)
|
||||
|
||||
func TestGraphBFS(t *testing.T) {
|
||||
/* 初始化無向圖 */
|
||||
vets := ValsToVets([]int{0, 1, 2, 3, 4, 5, 6, 7, 8, 9})
|
||||
edges := [][]Vertex{
|
||||
{vets[0], vets[1]}, {vets[0], vets[3]}, {vets[1], vets[2]}, {vets[1], vets[4]},
|
||||
{vets[2], vets[5]}, {vets[3], vets[4]}, {vets[3], vets[6]}, {vets[4], vets[5]},
|
||||
{vets[4], vets[7]}, {vets[5], vets[8]}, {vets[6], vets[7]}, {vets[7], vets[8]}}
|
||||
graph := newGraphAdjList(edges)
|
||||
fmt.Println("初始化後，圖為:")
|
||||
graph.print()
|
||||
|
||||
/* 廣度優先走訪 */
|
||||
res := graphBFS(graph, vets[0])
|
||||
fmt.Println("廣度優先走訪（BFS）頂點序列為:")
|
||||
PrintSlice(VetsToVals(res))
|
||||
}
|
||||
@@ -0,0 +1,36 @@
|
||||
// File: graph_dfs.go
|
||||
// Created Time: 2023-02-18
|
||||
// Author: Reanon (793584285@qq.com)
|
||||
|
||||
package chapter_graph
|
||||
|
||||
import (
|
||||
. "github.com/krahets/hello-algo/pkg"
|
||||
)
|
||||
|
||||
/* 深度優先走訪輔助函式 */
|
||||
func dfs(g *graphAdjList, visited map[Vertex]struct{}, res *[]Vertex, vet Vertex) {
|
||||
// append 操作會返回新的的引用，必須讓原引用重新賦值為新slice的引用
|
||||
*res = append(*res, vet)
|
||||
visited[vet] = struct{}{}
|
||||
// 走訪該頂點的所有鄰接頂點
|
||||
for _, adjVet := range g.adjList[vet] {
|
||||
_, isExist := visited[adjVet]
|
||||
// 遞迴訪問鄰接頂點
|
||||
if !isExist {
|
||||
dfs(g, visited, res, adjVet)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* 深度優先走訪 */
|
||||
// 使用鄰接表來表示圖，以便獲取指定頂點的所有鄰接頂點
|
||||
func graphDFS(g *graphAdjList, startVet Vertex) []Vertex {
|
||||
// 頂點走訪序列
|
||||
res := make([]Vertex, 0)
|
||||
// 雜湊表，用於記錄已被訪問過的頂點
|
||||
visited := make(map[Vertex]struct{})
|
||||
dfs(g, visited, &res, startVet)
|
||||
// 返回頂點走訪序列
|
||||
return res
|
||||
}
|
||||
@@ -0,0 +1,28 @@
|
||||
// File: graph_dfs_test.go
|
||||
// Created Time: 2023-02-18
|
||||
// Author: Reanon (793584285@qq.com)
|
||||
|
||||
package chapter_graph
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"testing"
|
||||
|
||||
. "github.com/krahets/hello-algo/pkg"
|
||||
)
|
||||
|
||||
func TestGraphDFS(t *testing.T) {
|
||||
/* 初始化無向圖 */
|
||||
vets := ValsToVets([]int{0, 1, 2, 3, 4, 5, 6})
|
||||
edges := [][]Vertex{
|
||||
{vets[0], vets[1]}, {vets[0], vets[3]}, {vets[1], vets[2]},
|
||||
{vets[2], vets[5]}, {vets[4], vets[5]}, {vets[5], vets[6]}}
|
||||
graph := newGraphAdjList(edges)
|
||||
fmt.Println("初始化後，圖為:")
|
||||
graph.print()
|
||||
|
||||
/* 深度優先走訪 */
|
||||
res := graphDFS(graph, vets[0])
|
||||
fmt.Println("深度優先走訪（DFS）頂點序列為:")
|
||||
PrintSlice(VetsToVals(res))
|
||||
}
|
||||
Reference in New Issue
Block a user