mirror of
https://github.com/krahets/hello-algo.git
synced 2026-07-09 14:06:06 +00: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,111 @@
|
||||
"""
|
||||
File: graph_adjacency_list.py
|
||||
Created Time: 2023-02-23
|
||||
Author: krahets (krahets@163.com)
|
||||
"""
|
||||
|
||||
import sys
|
||||
from pathlib import Path
|
||||
|
||||
sys.path.append(str(Path(__file__).parent.parent))
|
||||
from modules import Vertex, vals_to_vets
|
||||
|
||||
|
||||
class GraphAdjList:
|
||||
"""基於鄰接表實現的無向圖類別"""
|
||||
|
||||
def __init__(self, edges: list[list[Vertex]]):
|
||||
"""建構子"""
|
||||
# 鄰接表，key：頂點，value：該頂點的所有鄰接頂點
|
||||
self.adj_list = dict[Vertex, list[Vertex]]()
|
||||
# 新增所有頂點和邊
|
||||
for edge in edges:
|
||||
self.add_vertex(edge[0])
|
||||
self.add_vertex(edge[1])
|
||||
self.add_edge(edge[0], edge[1])
|
||||
|
||||
def size(self) -> int:
|
||||
"""獲取頂點數量"""
|
||||
return len(self.adj_list)
|
||||
|
||||
def add_edge(self, vet1: Vertex, vet2: Vertex):
|
||||
"""新增邊"""
|
||||
if vet1 not in self.adj_list or vet2 not in self.adj_list or vet1 == vet2:
|
||||
raise ValueError()
|
||||
# 新增邊 vet1 - vet2
|
||||
self.adj_list[vet1].append(vet2)
|
||||
self.adj_list[vet2].append(vet1)
|
||||
|
||||
def remove_edge(self, vet1: Vertex, vet2: Vertex):
|
||||
"""刪除邊"""
|
||||
if vet1 not in self.adj_list or vet2 not in self.adj_list or vet1 == vet2:
|
||||
raise ValueError()
|
||||
# 刪除邊 vet1 - vet2
|
||||
self.adj_list[vet1].remove(vet2)
|
||||
self.adj_list[vet2].remove(vet1)
|
||||
|
||||
def add_vertex(self, vet: Vertex):
|
||||
"""新增頂點"""
|
||||
if vet in self.adj_list:
|
||||
return
|
||||
# 在鄰接表中新增一個新鏈結串列
|
||||
self.adj_list[vet] = []
|
||||
|
||||
def remove_vertex(self, vet: Vertex):
|
||||
"""刪除頂點"""
|
||||
if vet not in self.adj_list:
|
||||
raise ValueError()
|
||||
# 在鄰接表中刪除頂點 vet 對應的鏈結串列
|
||||
self.adj_list.pop(vet)
|
||||
# 走訪其他頂點的鏈結串列，刪除所有包含 vet 的邊
|
||||
for vertex in self.adj_list:
|
||||
if vet in self.adj_list[vertex]:
|
||||
self.adj_list[vertex].remove(vet)
|
||||
|
||||
def print(self):
|
||||
"""列印鄰接表"""
|
||||
print("鄰接表 =")
|
||||
for vertex in self.adj_list:
|
||||
tmp = [v.val for v in self.adj_list[vertex]]
|
||||
print(f"{vertex.val}: {tmp},")
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化無向圖
|
||||
v = vals_to_vets([1, 3, 2, 5, 4])
|
||||
edges = [
|
||||
[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 = GraphAdjList(edges)
|
||||
print("\n初始化後，圖為")
|
||||
graph.print()
|
||||
|
||||
# 新增邊
|
||||
# 頂點 1, 2 即 v[0], v[2]
|
||||
graph.add_edge(v[0], v[2])
|
||||
print("\n新增邊 1-2 後，圖為")
|
||||
graph.print()
|
||||
|
||||
# 刪除邊
|
||||
# 頂點 1, 3 即 v[0], v[1]
|
||||
graph.remove_edge(v[0], v[1])
|
||||
print("\n刪除邊 1-3 後，圖為")
|
||||
graph.print()
|
||||
|
||||
# 新增頂點
|
||||
v5 = Vertex(6)
|
||||
graph.add_vertex(v5)
|
||||
print("\n新增頂點 6 後，圖為")
|
||||
graph.print()
|
||||
|
||||
# 刪除頂點
|
||||
# 頂點 3 即 v[1]
|
||||
graph.remove_vertex(v[1])
|
||||
print("\n刪除頂點 3 後，圖為")
|
||||
graph.print()
|
||||
@@ -0,0 +1,116 @@
|
||||
"""
|
||||
File: graph_adjacency_matrix.py
|
||||
Created Time: 2023-02-23
|
||||
Author: krahets (krahets@163.com)
|
||||
"""
|
||||
|
||||
import sys
|
||||
from pathlib import Path
|
||||
|
||||
sys.path.append(str(Path(__file__).parent.parent))
|
||||
from modules import Vertex, print_matrix
|
||||
|
||||
|
||||
class GraphAdjMat:
|
||||
"""基於鄰接矩陣實現的無向圖類別"""
|
||||
|
||||
def __init__(self, vertices: list[int], edges: list[list[int]]):
|
||||
"""建構子"""
|
||||
# 頂點串列，元素代表“頂點值”，索引代表“頂點索引”
|
||||
self.vertices: list[int] = []
|
||||
# 鄰接矩陣，行列索引對應“頂點索引”
|
||||
self.adj_mat: list[list[int]] = []
|
||||
# 新增頂點
|
||||
for val in vertices:
|
||||
self.add_vertex(val)
|
||||
# 新增邊
|
||||
# 請注意，edges 元素代表頂點索引，即對應 vertices 元素索引
|
||||
for e in edges:
|
||||
self.add_edge(e[0], e[1])
|
||||
|
||||
def size(self) -> int:
|
||||
"""獲取頂點數量"""
|
||||
return len(self.vertices)
|
||||
|
||||
def add_vertex(self, val: int):
|
||||
"""新增頂點"""
|
||||
n = self.size()
|
||||
# 向頂點串列中新增新頂點的值
|
||||
self.vertices.append(val)
|
||||
# 在鄰接矩陣中新增一行
|
||||
new_row = [0] * n
|
||||
self.adj_mat.append(new_row)
|
||||
# 在鄰接矩陣中新增一列
|
||||
for row in self.adj_mat:
|
||||
row.append(0)
|
||||
|
||||
def remove_vertex(self, index: int):
|
||||
"""刪除頂點"""
|
||||
if index >= self.size():
|
||||
raise IndexError()
|
||||
# 在頂點串列中移除索引 index 的頂點
|
||||
self.vertices.pop(index)
|
||||
# 在鄰接矩陣中刪除索引 index 的行
|
||||
self.adj_mat.pop(index)
|
||||
# 在鄰接矩陣中刪除索引 index 的列
|
||||
for row in self.adj_mat:
|
||||
row.pop(index)
|
||||
|
||||
def add_edge(self, i: int, j: int):
|
||||
"""新增邊"""
|
||||
# 參數 i, j 對應 vertices 元素索引
|
||||
# 索引越界與相等處理
|
||||
if i < 0 or j < 0 or i >= self.size() or j >= self.size() or i == j:
|
||||
raise IndexError()
|
||||
# 在無向圖中，鄰接矩陣關於主對角線對稱，即滿足 (i, j) == (j, i)
|
||||
self.adj_mat[i][j] = 1
|
||||
self.adj_mat[j][i] = 1
|
||||
|
||||
def remove_edge(self, i: int, j: int):
|
||||
"""刪除邊"""
|
||||
# 參數 i, j 對應 vertices 元素索引
|
||||
# 索引越界與相等處理
|
||||
if i < 0 or j < 0 or i >= self.size() or j >= self.size() or i == j:
|
||||
raise IndexError()
|
||||
self.adj_mat[i][j] = 0
|
||||
self.adj_mat[j][i] = 0
|
||||
|
||||
def print(self):
|
||||
"""列印鄰接矩陣"""
|
||||
print("頂點串列 =", self.vertices)
|
||||
print("鄰接矩陣 =")
|
||||
print_matrix(self.adj_mat)
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化無向圖
|
||||
# 請注意，edges 元素代表頂點索引，即對應 vertices 元素索引
|
||||
vertices = [1, 3, 2, 5, 4]
|
||||
edges = [[0, 1], [0, 3], [1, 2], [2, 3], [2, 4], [3, 4]]
|
||||
graph = GraphAdjMat(vertices, edges)
|
||||
print("\n初始化後，圖為")
|
||||
graph.print()
|
||||
|
||||
# 新增邊
|
||||
# 頂點 1, 2 的索引分別為 0, 2
|
||||
graph.add_edge(0, 2)
|
||||
print("\n新增邊 1-2 後，圖為")
|
||||
graph.print()
|
||||
|
||||
# 刪除邊
|
||||
# 頂點 1, 3 的索引分別為 0, 1
|
||||
graph.remove_edge(0, 1)
|
||||
print("\n刪除邊 1-3 後，圖為")
|
||||
graph.print()
|
||||
|
||||
# 新增頂點
|
||||
graph.add_vertex(6)
|
||||
print("\n新增頂點 6 後，圖為")
|
||||
graph.print()
|
||||
|
||||
# 刪除頂點
|
||||
# 頂點 3 的索引為 1
|
||||
graph.remove_vertex(1)
|
||||
print("\n刪除頂點 3 後，圖為")
|
||||
graph.print()
|
||||
@@ -0,0 +1,64 @@
|
||||
"""
|
||||
File: graph_bfs.py
|
||||
Created Time: 2023-02-23
|
||||
Author: krahets (krahets@163.com)
|
||||
"""
|
||||
|
||||
import sys
|
||||
from pathlib import Path
|
||||
|
||||
sys.path.append(str(Path(__file__).parent.parent))
|
||||
from modules import Vertex, vals_to_vets, vets_to_vals
|
||||
from collections import deque
|
||||
from graph_adjacency_list import GraphAdjList
|
||||
|
||||
|
||||
def graph_bfs(graph: GraphAdjList, start_vet: Vertex) -> list[Vertex]:
|
||||
"""廣度優先走訪"""
|
||||
# 使用鄰接表來表示圖，以便獲取指定頂點的所有鄰接頂點
|
||||
# 頂點走訪序列
|
||||
res = []
|
||||
# 雜湊表，用於記錄已被訪問過的頂點
|
||||
visited = set[Vertex]([start_vet])
|
||||
# 佇列用於實現 BFS
|
||||
que = deque[Vertex]([start_vet])
|
||||
# 以頂點 vet 為起點，迴圈直至訪問完所有頂點
|
||||
while len(que) > 0:
|
||||
vet = que.popleft() # 佇列首頂點出隊
|
||||
res.append(vet) # 記錄訪問頂點
|
||||
# 走訪該頂點的所有鄰接頂點
|
||||
for adj_vet in graph.adj_list[vet]:
|
||||
if adj_vet in visited:
|
||||
continue # 跳過已被訪問的頂點
|
||||
que.append(adj_vet) # 只入列未訪問的頂點
|
||||
visited.add(adj_vet) # 標記該頂點已被訪問
|
||||
# 返回頂點走訪序列
|
||||
return res
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化無向圖
|
||||
v = vals_to_vets([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
|
||||
edges = [
|
||||
[v[0], v[1]],
|
||||
[v[0], v[3]],
|
||||
[v[1], v[2]],
|
||||
[v[1], v[4]],
|
||||
[v[2], v[5]],
|
||||
[v[3], v[4]],
|
||||
[v[3], v[6]],
|
||||
[v[4], v[5]],
|
||||
[v[4], v[7]],
|
||||
[v[5], v[8]],
|
||||
[v[6], v[7]],
|
||||
[v[7], v[8]],
|
||||
]
|
||||
graph = GraphAdjList(edges)
|
||||
print("\n初始化後，圖為")
|
||||
graph.print()
|
||||
|
||||
# 廣度優先走訪
|
||||
res = graph_bfs(graph, v[0])
|
||||
print("\n廣度優先走訪（BFS）頂點序列為")
|
||||
print(vets_to_vals(res))
|
||||
@@ -0,0 +1,57 @@
|
||||
"""
|
||||
File: graph_dfs.py
|
||||
Created Time: 2023-02-23
|
||||
Author: krahets (krahets@163.com)
|
||||
"""
|
||||
|
||||
import sys
|
||||
from pathlib import Path
|
||||
|
||||
sys.path.append(str(Path(__file__).parent.parent))
|
||||
from modules import Vertex, vets_to_vals, vals_to_vets
|
||||
from graph_adjacency_list import GraphAdjList
|
||||
|
||||
|
||||
def dfs(graph: GraphAdjList, visited: set[Vertex], res: list[Vertex], vet: Vertex):
|
||||
"""深度優先走訪輔助函式"""
|
||||
res.append(vet) # 記錄訪問頂點
|
||||
visited.add(vet) # 標記該頂點已被訪問
|
||||
# 走訪該頂點的所有鄰接頂點
|
||||
for adjVet in graph.adj_list[vet]:
|
||||
if adjVet in visited:
|
||||
continue # 跳過已被訪問的頂點
|
||||
# 遞迴訪問鄰接頂點
|
||||
dfs(graph, visited, res, adjVet)
|
||||
|
||||
|
||||
def graph_dfs(graph: GraphAdjList, start_vet: Vertex) -> list[Vertex]:
|
||||
"""深度優先走訪"""
|
||||
# 使用鄰接表來表示圖，以便獲取指定頂點的所有鄰接頂點
|
||||
# 頂點走訪序列
|
||||
res = []
|
||||
# 雜湊表，用於記錄已被訪問過的頂點
|
||||
visited = set[Vertex]()
|
||||
dfs(graph, visited, res, start_vet)
|
||||
return res
|
||||
|
||||
|
||||
"""Driver Code"""
|
||||
if __name__ == "__main__":
|
||||
# 初始化無向圖
|
||||
v = vals_to_vets([0, 1, 2, 3, 4, 5, 6])
|
||||
edges = [
|
||||
[v[0], v[1]],
|
||||
[v[0], v[3]],
|
||||
[v[1], v[2]],
|
||||
[v[2], v[5]],
|
||||
[v[4], v[5]],
|
||||
[v[5], v[6]],
|
||||
]
|
||||
graph = GraphAdjList(edges)
|
||||
print("\n初始化後，圖為")
|
||||
graph.print()
|
||||
|
||||
# 深度優先走訪
|
||||
res = graph_dfs(graph, v[0])
|
||||
print("\n深度優先走訪（DFS）頂點序列為")
|
||||
print(vets_to_vals(res))
|
||||
Reference in New Issue
Block a user