mirror of
https://github.com/krahets/hello-algo.git
synced 2026-09-02 13:17:14 +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,142 @@
|
||||
/*
|
||||
* File: graph_adjacency_list.rs
|
||||
* Created Time: 2023-07-12
|
||||
* Author: night-cruise (2586447362@qq.com)
|
||||
*/
|
||||
|
||||
include!("../include/vertex.rs");
|
||||
|
||||
use std::collections::HashMap;
|
||||
|
||||
/* 基於鄰接表實現的無向圖型別 */
|
||||
pub struct GraphAdjList {
|
||||
// 鄰接表，key：頂點，value：該頂點的所有鄰接頂點
|
||||
pub adj_list: HashMap<Vertex, Vec<Vertex>>,
|
||||
}
|
||||
|
||||
impl GraphAdjList {
|
||||
/* 建構子 */
|
||||
pub fn new(edges: Vec<[Vertex; 2]>) -> Self {
|
||||
let mut graph = GraphAdjList {
|
||||
adj_list: HashMap::new(),
|
||||
};
|
||||
// 新增所有頂點和邊
|
||||
for edge in edges {
|
||||
graph.add_vertex(edge[0]);
|
||||
graph.add_vertex(edge[1]);
|
||||
graph.add_edge(edge[0], edge[1]);
|
||||
}
|
||||
|
||||
graph
|
||||
}
|
||||
|
||||
/* 獲取頂點數量 */
|
||||
#[allow(unused)]
|
||||
pub fn size(&self) -> usize {
|
||||
self.adj_list.len()
|
||||
}
|
||||
|
||||
/* 新增邊 */
|
||||
pub fn add_edge(&mut self, vet1: Vertex, vet2: Vertex) {
|
||||
if !self.adj_list.contains_key(&vet1) || !self.adj_list.contains_key(&vet2) || vet1 == vet2
|
||||
{
|
||||
panic!("value error");
|
||||
}
|
||||
// 新增邊 vet1 - vet2
|
||||
self.adj_list.get_mut(&vet1).unwrap().push(vet2);
|
||||
self.adj_list.get_mut(&vet2).unwrap().push(vet1);
|
||||
}
|
||||
|
||||
/* 刪除邊 */
|
||||
#[allow(unused)]
|
||||
pub fn remove_edge(&mut self, vet1: Vertex, vet2: Vertex) {
|
||||
if !self.adj_list.contains_key(&vet1) || !self.adj_list.contains_key(&vet2) || vet1 == vet2
|
||||
{
|
||||
panic!("value error");
|
||||
}
|
||||
// 刪除邊 vet1 - vet2
|
||||
self.adj_list
|
||||
.get_mut(&vet1)
|
||||
.unwrap()
|
||||
.retain(|&vet| vet != vet2);
|
||||
self.adj_list
|
||||
.get_mut(&vet2)
|
||||
.unwrap()
|
||||
.retain(|&vet| vet != vet1);
|
||||
}
|
||||
|
||||
/* 新增頂點 */
|
||||
pub fn add_vertex(&mut self, vet: Vertex) {
|
||||
if self.adj_list.contains_key(&vet) {
|
||||
return;
|
||||
}
|
||||
// 在鄰接表中新增一個新鏈結串列
|
||||
self.adj_list.insert(vet, vec![]);
|
||||
}
|
||||
|
||||
/* 刪除頂點 */
|
||||
#[allow(unused)]
|
||||
pub fn remove_vertex(&mut self, vet: Vertex) {
|
||||
if !self.adj_list.contains_key(&vet) {
|
||||
panic!("value error");
|
||||
}
|
||||
// 在鄰接表中刪除頂點 vet 對應的鏈結串列
|
||||
self.adj_list.remove(&vet);
|
||||
// 走訪其他頂點的鏈結串列，刪除所有包含 vet 的邊
|
||||
for list in self.adj_list.values_mut() {
|
||||
list.retain(|&v| v != vet);
|
||||
}
|
||||
}
|
||||
|
||||
/* 列印鄰接表 */
|
||||
pub fn print(&self) {
|
||||
println!("鄰接表 =");
|
||||
for (vertex, list) in &self.adj_list {
|
||||
let list = list.iter().map(|vertex| vertex.val).collect::<Vec<i32>>();
|
||||
println!("{}: {:?},", vertex.val, list);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
#[allow(unused)]
|
||||
fn main() {
|
||||
/* 初始化無向圖 */
|
||||
let v = vals_to_vets(vec![1, 3, 2, 5, 4]);
|
||||
let edges = vec![
|
||||
[v[0], v[1]],
|
||||
[v[0], v[3]],
|
||||
[v[1], v[2]],
|
||||
[v[2], v[3]],
|
||||
[v[2], v[4]],
|
||||
[v[3], v[4]],
|
||||
];
|
||||
|
||||
let mut graph = GraphAdjList::new(edges);
|
||||
println!("\n初始化後，圖為");
|
||||
graph.print();
|
||||
|
||||
/* 新增邊 */
|
||||
// 頂點 1, 2 即 v[0], v[2]
|
||||
graph.add_edge(v[0], v[2]);
|
||||
println!("\n新增邊 1-2 後，圖為");
|
||||
graph.print();
|
||||
|
||||
/* 刪除邊 */
|
||||
// 頂點 1, 3 即 v[0], v[1]
|
||||
graph.remove_edge(v[0], v[1]);
|
||||
println!("\n刪除邊 1-3 後，圖為");
|
||||
graph.print();
|
||||
|
||||
/* 新增頂點 */
|
||||
let v5 = Vertex { val: 6 };
|
||||
graph.add_vertex(v5);
|
||||
println!("\n新增頂點 6 後，圖為");
|
||||
graph.print();
|
||||
|
||||
/* 刪除頂點 */
|
||||
// 頂點 3 即 v[1]
|
||||
graph.remove_vertex(v[1]);
|
||||
println!("\n刪除頂點 3 後，圖為");
|
||||
graph.print();
|
||||
}
|
||||
@@ -0,0 +1,136 @@
|
||||
/*
|
||||
* File: graph_adjacency_matrix.rs
|
||||
* Created Time: 2023-07-12
|
||||
* Author: night-cruise (2586447362@qq.com)
|
||||
*/
|
||||
|
||||
/* 基於鄰接矩陣實現的無向圖型別 */
|
||||
pub struct GraphAdjMat {
|
||||
// 頂點串列，元素代表“頂點值”，索引代表“頂點索引”
|
||||
pub vertices: Vec<i32>,
|
||||
// 鄰接矩陣，行列索引對應“頂點索引”
|
||||
pub adj_mat: Vec<Vec<i32>>,
|
||||
}
|
||||
|
||||
impl GraphAdjMat {
|
||||
/* 建構子 */
|
||||
pub fn new(vertices: Vec<i32>, edges: Vec<[usize; 2]>) -> Self {
|
||||
let mut graph = GraphAdjMat {
|
||||
vertices: vec![],
|
||||
adj_mat: vec![],
|
||||
};
|
||||
// 新增頂點
|
||||
for val in vertices {
|
||||
graph.add_vertex(val);
|
||||
}
|
||||
// 新增邊
|
||||
// 請注意，edges 元素代表頂點索引，即對應 vertices 元素索引
|
||||
for edge in edges {
|
||||
graph.add_edge(edge[0], edge[1])
|
||||
}
|
||||
|
||||
graph
|
||||
}
|
||||
|
||||
/* 獲取頂點數量 */
|
||||
pub fn size(&self) -> usize {
|
||||
self.vertices.len()
|
||||
}
|
||||
|
||||
/* 新增頂點 */
|
||||
pub fn add_vertex(&mut self, val: i32) {
|
||||
let n = self.size();
|
||||
// 向頂點串列中新增新頂點的值
|
||||
self.vertices.push(val);
|
||||
// 在鄰接矩陣中新增一行
|
||||
self.adj_mat.push(vec![0; n]);
|
||||
// 在鄰接矩陣中新增一列
|
||||
for row in &mut self.adj_mat {
|
||||
row.push(0);
|
||||
}
|
||||
}
|
||||
|
||||
/* 刪除頂點 */
|
||||
pub fn remove_vertex(&mut self, index: usize) {
|
||||
if index >= self.size() {
|
||||
panic!("index error")
|
||||
}
|
||||
// 在頂點串列中移除索引 index 的頂點
|
||||
self.vertices.remove(index);
|
||||
// 在鄰接矩陣中刪除索引 index 的行
|
||||
self.adj_mat.remove(index);
|
||||
// 在鄰接矩陣中刪除索引 index 的列
|
||||
for row in &mut self.adj_mat {
|
||||
row.remove(index);
|
||||
}
|
||||
}
|
||||
|
||||
/* 新增邊 */
|
||||
pub fn add_edge(&mut self, i: usize, j: usize) {
|
||||
// 參數 i, j 對應 vertices 元素索引
|
||||
// 索引越界與相等處理
|
||||
if i >= self.size() || j >= self.size() || i == j {
|
||||
panic!("index error")
|
||||
}
|
||||
// 在無向圖中，鄰接矩陣關於主對角線對稱，即滿足 (i, j) == (j, i)
|
||||
self.adj_mat[i][j] = 1;
|
||||
self.adj_mat[j][i] = 1;
|
||||
}
|
||||
|
||||
/* 刪除邊 */
|
||||
// 參數 i, j 對應 vertices 元素索引
|
||||
pub fn remove_edge(&mut self, i: usize, j: usize) {
|
||||
// 參數 i, j 對應 vertices 元素索引
|
||||
// 索引越界與相等處理
|
||||
if i >= self.size() || j >= self.size() || i == j {
|
||||
panic!("index error")
|
||||
}
|
||||
self.adj_mat[i][j] = 0;
|
||||
self.adj_mat[j][i] = 0;
|
||||
}
|
||||
|
||||
/* 列印鄰接矩陣 */
|
||||
pub fn print(&self) {
|
||||
println!("頂點串列 = {:?}", self.vertices);
|
||||
println!("鄰接矩陣 =");
|
||||
println!("[");
|
||||
for row in &self.adj_mat {
|
||||
println!(" {:?},", row);
|
||||
}
|
||||
println!("]")
|
||||
}
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
fn main() {
|
||||
/* 初始化無向圖 */
|
||||
// 請注意，edges 元素代表頂點索引，即對應 vertices 元素索引
|
||||
let vertices = vec![1, 3, 2, 5, 4];
|
||||
let edges = vec![[0, 1], [0, 3], [1, 2], [2, 3], [2, 4], [3, 4]];
|
||||
let mut graph = GraphAdjMat::new(vertices, edges);
|
||||
println!("\n初始化後，圖為");
|
||||
graph.print();
|
||||
|
||||
/* 新增邊 */
|
||||
// 頂點 1, 2 的索引分別為 0, 2
|
||||
graph.add_edge(0, 2);
|
||||
println!("\n新增邊 1-2 後，圖為");
|
||||
graph.print();
|
||||
|
||||
/* 刪除邊 */
|
||||
// 頂點 1, 3 的索引分別為 0, 1
|
||||
graph.remove_edge(0, 1);
|
||||
println!("\n刪除邊 1-3 後，圖為");
|
||||
graph.print();
|
||||
|
||||
/* 新增頂點 */
|
||||
graph.add_vertex(6);
|
||||
println!("\n新增頂點 6 後，圖為");
|
||||
graph.print();
|
||||
|
||||
/* 刪除頂點 */
|
||||
// 頂點 3 的索引為 1
|
||||
graph.remove_vertex(1);
|
||||
println!("\n刪除頂點 3 後，圖為");
|
||||
graph.print();
|
||||
}
|
||||
@@ -0,0 +1,70 @@
|
||||
/*
|
||||
* File: graph_bfs.rs
|
||||
* Created Time: 2023-07-12
|
||||
* Author: night-cruise (2586447362@qq.com)
|
||||
*/
|
||||
|
||||
mod graph_adjacency_list;
|
||||
|
||||
use graph_adjacency_list::GraphAdjList;
|
||||
use graph_adjacency_list::{vals_to_vets, vets_to_vals, Vertex};
|
||||
use std::collections::{HashSet, VecDeque};
|
||||
|
||||
/* 廣度優先走訪 */
|
||||
// 使用鄰接表來表示圖，以便獲取指定頂點的所有鄰接頂點
|
||||
fn graph_bfs(graph: GraphAdjList, start_vet: Vertex) -> Vec<Vertex> {
|
||||
// 頂點走訪序列
|
||||
let mut res = vec![];
|
||||
// 雜湊表，用於記錄已被訪問過的頂點
|
||||
let mut visited = HashSet::new();
|
||||
visited.insert(start_vet);
|
||||
// 佇列用於實現 BFS
|
||||
let mut que = VecDeque::new();
|
||||
que.push_back(start_vet);
|
||||
// 以頂點 vet 為起點，迴圈直至訪問完所有頂點
|
||||
while !que.is_empty() {
|
||||
let vet = que.pop_front().unwrap(); // 佇列首頂點出隊
|
||||
res.push(vet); // 記錄訪問頂點
|
||||
|
||||
// 走訪該頂點的所有鄰接頂點
|
||||
if let Some(adj_vets) = graph.adj_list.get(&vet) {
|
||||
for &adj_vet in adj_vets {
|
||||
if visited.contains(&adj_vet) {
|
||||
continue; // 跳過已被訪問的頂點
|
||||
}
|
||||
que.push_back(adj_vet); // 只入列未訪問的頂點
|
||||
visited.insert(adj_vet); // 標記該頂點已被訪問
|
||||
}
|
||||
}
|
||||
}
|
||||
// 返回頂點走訪序列
|
||||
res
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
fn main() {
|
||||
/* 初始化無向圖 */
|
||||
let v = vals_to_vets(vec![0, 1, 2, 3, 4, 5, 6, 7, 8, 9]);
|
||||
let edges = vec![
|
||||
[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]],
|
||||
];
|
||||
let graph = GraphAdjList::new(edges);
|
||||
println!("\n初始化後，圖為");
|
||||
graph.print();
|
||||
|
||||
/* 廣度優先走訪 */
|
||||
let res = graph_bfs(graph, v[0]);
|
||||
println!("\n廣度優先走訪（BFS）頂點序列為");
|
||||
println!("{:?}", vets_to_vals(res));
|
||||
}
|
||||
@@ -0,0 +1,61 @@
|
||||
/*
|
||||
* File: graph_dfs.rs
|
||||
* Created Time: 2023-07-12
|
||||
* Author: night-cruise (2586447362@qq.com)
|
||||
*/
|
||||
|
||||
mod graph_adjacency_list;
|
||||
|
||||
use graph_adjacency_list::GraphAdjList;
|
||||
use graph_adjacency_list::{vals_to_vets, vets_to_vals, Vertex};
|
||||
use std::collections::HashSet;
|
||||
|
||||
/* 深度優先走訪輔助函式 */
|
||||
fn dfs(graph: &GraphAdjList, visited: &mut HashSet<Vertex>, res: &mut Vec<Vertex>, vet: Vertex) {
|
||||
res.push(vet); // 記錄訪問頂點
|
||||
visited.insert(vet); // 標記該頂點已被訪問
|
||||
// 走訪該頂點的所有鄰接頂點
|
||||
if let Some(adj_vets) = graph.adj_list.get(&vet) {
|
||||
for &adj_vet in adj_vets {
|
||||
if visited.contains(&adj_vet) {
|
||||
continue; // 跳過已被訪問的頂點
|
||||
}
|
||||
// 遞迴訪問鄰接頂點
|
||||
dfs(graph, visited, res, adj_vet);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* 深度優先走訪 */
|
||||
// 使用鄰接表來表示圖，以便獲取指定頂點的所有鄰接頂點
|
||||
fn graph_dfs(graph: GraphAdjList, start_vet: Vertex) -> Vec<Vertex> {
|
||||
// 頂點走訪序列
|
||||
let mut res = vec![];
|
||||
// 雜湊表，用於記錄已被訪問過的頂點
|
||||
let mut visited = HashSet::new();
|
||||
dfs(&graph, &mut visited, &mut res, start_vet);
|
||||
|
||||
res
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
fn main() {
|
||||
/* 初始化無向圖 */
|
||||
let v = vals_to_vets(vec![0, 1, 2, 3, 4, 5, 6]);
|
||||
let edges = vec![
|
||||
[v[0], v[1]],
|
||||
[v[0], v[3]],
|
||||
[v[1], v[2]],
|
||||
[v[2], v[5]],
|
||||
[v[4], v[5]],
|
||||
[v[5], v[6]],
|
||||
];
|
||||
let graph = GraphAdjList::new(edges);
|
||||
println!("\n初始化後，圖為");
|
||||
graph.print();
|
||||
|
||||
/* 深度優先走訪 */
|
||||
let res = graph_dfs(graph, v[0]);
|
||||
println!("\n深度優先走訪（DFS）頂點序列為");
|
||||
println!("{:?}", vets_to_vals(res));
|
||||
}
|
||||
Reference in New Issue
Block a user