zhihui/suanfa
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

宽度调整

Browse Source
This commit is contained in:
changjunqiang
2026-06-16 15:32:49 +08:00
parent 7b30435d5a
commit 5cc164479f
6 changed files with 513 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/data/chapters.js
+167
View File
@@ -16,6 +16,39 @@ export const chapters = [
'递归算法复杂度',
'实验对比分析方法'
],
knowledgeGraph: {
nodes: [
{ id: 'algo', label: '算法分析', desc: '评估算法效率的方法论' },
{ id: 'time', label: '时间复杂度', desc: '运行时间随输入规模增长的量级' },
{ id: 'space', label: '空间复杂度', desc: '运行所需的额外存储空间量级' },
{ id: 'bigO', label: '大O记号', desc: '渐近上界 f(n)=O(g(n))' },
{ id: 'bigOmega', label: '大Ω记号', desc: '渐近下界 f(n)=Ω(g(n))' },
{ id: 'bigTheta', label: '大Θ记号', desc: '渐近紧界 f(n)=Θ(g(n))' },
{ id: 'recursive', label: '递归复杂度', desc: '递归算法的时间复杂度分析' },
{ id: 'compare', label: '实验对比', desc: '通过实际运行比较算法性能' },
{ id: 'const', label: 'O(1) 常数阶', desc: '运行时间与 n 无关' },
{ id: 'log', label: 'O(log n) 对数阶', desc: '二分法、倍增法' },
{ id: 'linear', label: 'O(n) 线性阶', desc: '单次遍历' },
{ id: 'nlogn', label: 'O(n log n) 线性对数阶', desc: '分治排序' },
{ id: 'square', label: 'O(n²) 平方阶', desc: '双层循环' },
{ id: 'exp', label: 'O(2ⁿ) 指数阶', desc: '回溯搜索' }
],
edges: [
{ source: 'algo', target: 'time', label: '核心指标' },
{ source: 'algo', target: 'space', label: '核心指标' },
{ source: 'time', target: 'bigO', label: '常用表示' },
{ source: 'time', target: 'bigOmega', label: '常用表示' },
{ source: 'time', target: 'bigTheta', label: '常用表示' },
{ source: 'time', target: 'recursive', label: '特殊情形' },
{ source: 'time', target: 'compare', label: '验证手段' },
{ source: 'bigO', target: 'const', label: '最优' },
{ source: 'bigO', target: 'log', label: '高效' },
{ source: 'bigO', target: 'linear', label: '中等' },
{ source: 'bigO', target: 'nlogn', label: '较慢' },
{ source: 'bigO', target: 'square', label: '慢' },
{ source: 'bigO', target: 'exp', label: '不可行' }
]
},
subfolders: [
{
name: 'complexity-demo',
@@ -50,6 +83,39 @@ export const chapters = [
'递归求最大值',
'全排列生成'
],
knowledgeGraph: {
nodes: [
{ id: 'divide', label: '分治策略', desc: '分解→解决→合并' },
{ id: 'split', label: '分解(Divide)', desc: '将大问题拆分为子问题' },
{ id: 'conquer', label: '解决(Conquer)', desc: '递归求解子问题' },
{ id: 'merge', label: '合并(Combine)', desc: '将子问题解合并为原问题解' },
{ id: 'sort', label: '排序问题', desc: '基于比较的排序算法' },
{ id: 'search', label: '查找问题', desc: '在有序数据中搜索' },
{ id: 'math', label: '数学问题', desc: '数值计算中的分治应用' },
{ id: 'mergesort', label: '归并排序', desc: '先递归排序再合并 O(n log n)' },
{ id: 'quicksort', label: '快速排序', desc: '先划分再递归排序 O(n log n)' },
{ id: 'halfsearch', label: '二分查找', desc: '每次缩小一半范围 O(log n)' },
{ id: 'bigint', label: '大整数乘法', desc: '分治降低乘法次数' },
{ id: 'matrix', label: '矩阵乘法', desc: 'Strassen O(n^2.81)' },
{ id: 'recursion', label: '递归技术', desc: '函数自身调用的编程技巧' },
{ id: 'permutation', label: '全排列生成', desc: '递归交换生成所有排列' }
],
edges: [
{ source: 'divide', target: 'split', label: '步骤一' },
{ source: 'divide', target: 'conquer', label: '步骤二' },
{ source: 'divide', target: 'merge', label: '步骤三' },
{ source: 'divide', target: 'sort', label: '典型应用' },
{ source: 'divide', target: 'search', label: '典型应用' },
{ source: 'divide', target: 'math', label: '典型应用' },
{ source: 'divide', target: 'recursion', label: '实现基础' },
{ source: 'sort', target: 'mergesort', label: '稳定排序' },
{ source: 'sort', target: 'quicksort', label: '原地排序' },
{ source: 'search', target: 'halfsearch', label: '有序查找' },
{ source: 'math', target: 'bigint', label: '数值分治' },
{ source: 'math', target: 'matrix', label: '矩阵分治' },
{ source: 'recursion', target: 'permutation', label: '交换法' }
]
},
subfolders: [
{
name: 'mergesort',
@@ -152,6 +218,34 @@ export const chapters = [
'最少硬币问题',
'杨辉三角'
],
knowledgeGraph: {
nodes: [
{ id: 'dp', label: '动态规划', desc: '最优子结构 + 重叠子问题' },
{ id: 'substructure', label: '最优子结构', desc: '问题最优解包含子问题最优解' },
{ id: 'overlap', label: '重叠子问题', desc: '子问题被反复求解' },
{ id: 'bottomup', label: '自底向上', desc: '从最小子问题开始逐步求解' },
{ id: 'memo', label: '记忆化搜索', desc: '自顶向下 + 查表' },
{ id: 'table', label: 'DP表/状态转移', desc: '用表格记录子问题解' },
{ id: 'knapsack', label: '0/1背包问题', desc: '选或不选，容量限制下价值最大' },
{ id: 'lcs', label: '最长公共子序列', desc: '两序列的最长公共子序列' },
{ id: 'matrixchain', label: '矩阵链乘', desc: '最优括号化方案' },
{ id: 'image', label: '图像压缩', desc: '最优像素段划分' },
{ id: 'coin', label: '最少硬币', desc: '最少硬币凑出目标金额' }
],
edges: [
{ source: 'dp', target: 'substructure', label: '性质一' },
{ source: 'dp', target: 'overlap', label: '性质二' },
{ source: 'dp', target: 'bottomup', label: '实现方式' },
{ source: 'dp', target: 'memo', label: '实现方式' },
{ source: 'bottomup', target: 'table', label: '核心手段' },
{ source: 'memo', target: 'table', label: '核心手段' },
{ source: 'dp', target: 'knapsack', label: '经典问题' },
{ source: 'dp', target: 'lcs', label: '经典问题' },
{ source: 'dp', target: 'matrixchain', label: '经典问题' },
{ source: 'dp', target: 'image', label: '经典问题' },
{ source: 'dp', target: 'coin', label: '经典问题' }
]
},
subfolders: [
{
name: 'bag01',
@@ -217,6 +311,31 @@ export const chapters = [
'最短路径',
'找零问题'
],
knowledgeGraph: {
nodes: [
{ id: 'greedy', label: '贪心策略', desc: '每步选当前最优' },
{ id: 'local', label: '局部最优选择', desc: '当前看来最好的选择' },
{ id: 'global', label: '全局最优解', desc: '贪心选择性质保证' },
{ id: 'optstruct', label: '最优子结构', desc: '子问题最优推导全局最优' },
{ id: 'activity', label: '活动选择', desc: '选择最多不重叠活动' },
{ id: 'huffman', label: 'Huffman编码', desc: '最优前缀码实现数据压缩' },
{ id: 'fbag', label: '贪心背包', desc: '部分背包按单位价值贪心' },
{ id: 'loading', label: '最优装载', desc: '重量限制下装最多的物品' },
{ id: 'path', label: '最短路径', desc: 'Dijkstra：按距离贪心' },
{ id: 'change', label: '找零问题', desc: '按面额从大到小贪心' }
],
edges: [
{ source: 'greedy', target: 'local', label: '核心' },
{ source: 'greedy', target: 'optstruct', label: '前提' },
{ source: 'local', target: 'global', label: '最终目标' },
{ source: 'greedy', target: 'activity', label: '经典应用' },
{ source: 'greedy', target: 'huffman', label: '经典应用' },
{ source: 'greedy', target: 'fbag', label: '经典应用' },
{ source: 'greedy', target: 'loading', label: '经典应用' },
{ source: 'greedy', target: 'path', label: '经典应用' },
{ source: 'greedy', target: 'change', label: '经典应用' }
]
},
subfolders: [
{
name: 'huodong',
@@ -283,6 +402,29 @@ export const chapters = [
'装载问题的回溯解法',
'N皇后问题'
],
knowledgeGraph: {
nodes: [
{ id: 'backtrack', label: '回溯法', desc: 'DFS + 剪枝' },
{ id: 'dfs', label: '深度优先搜索', desc: '沿着一条路径搜索到底' },
{ id: 'tree', label: '解空间树', desc: '所有可能解的树形表示' },
{ id: 'prune', label: '剪枝函数', desc: '提前终止无效分支' },
{ id: 'constraint', label: '约束函数', desc: '判断部分解是否可行' },
{ id: 'bound', label: '限界函数', desc: '判断是否可能优于已知最优' },
{ id: 'bkbag', label: '0/1背包(回溯)', desc: '选或不选 + 上界剪枝' },
{ id: 'bkload', label: '装载问题', desc: '搜索最优装载方案' },
{ id: 'nqueen', label: 'N皇后问题', desc: '棋盘上放置不攻击的皇后' }
],
edges: [
{ source: 'backtrack', target: 'dfs', label: '搜索策略' },
{ source: 'backtrack', target: 'tree', label: '搜索对象' },
{ source: 'backtrack', target: 'prune', label: '优化核心' },
{ source: 'prune', target: 'constraint', label: '可行性' },
{ source: 'prune', target: 'bound', label: '最优性' },
{ source: 'backtrack', target: 'bkbag', label: '应用' },
{ source: 'backtrack', target: 'bkload', label: '应用' },
{ source: 'backtrack', target: 'nqueen', label: '应用' }
]
},
subfolders: [
{
name: 'hui01bag',
@@ -322,6 +464,31 @@ export const chapters = [
'旅行商问题(TSP)',
'图的BFS与DFS遍历'
],
knowledgeGraph: {
nodes: [
{ id: 'bnb', label: '分支限界法', desc: 'BFS + 优先队列 + 剪枝' },
{ id: 'bfs', label: '广度优先搜索', desc: '按层逐级扩展' },
{ id: 'pq', label: '优先队列', desc: '按限界值选取扩展结点' },
{ id: 'livenode', label: '活结点表', desc: '待扩展的结点集合' },
{ id: 'upper', label: '上界函数', desc: '估算当前结点可达的最优值' },
{ id: 'bnbprune', label: '剪枝', desc: '上界 ≤ 当前最优则剪枝' },
{ id: 'bnbbag', label: '0/1背包(B&B)', desc: '上界剪枝搜索最优解' },
{ id: 'tsp', label: '旅行商问题', desc: '寻找最短环游路径' },
{ id: 'traversal', label: '图遍历', desc: 'BFS / DFS 遍历图' }
],
edges: [
{ source: 'bnb', target: 'bfs', label: '搜索方式' },
{ source: 'bnb', target: 'pq', label: '扩展策略' },
{ source: 'bnb', target: 'upper', label: '估值函数' },
{ source: 'bnb', target: 'bnbprune', label: '剪枝' },
{ source: 'bfs', target: 'livenode', label: '使用队列' },
{ source: 'pq', target: 'livenode', label: '管理结点' },
{ source: 'upper', target: 'bnbprune', label: '剪枝依据' },
{ source: 'bnb', target: 'bnbbag', label: '应用' },
{ source: 'bnb', target: 'tsp', label: '应用' },
{ source: 'bnb', target: 'traversal', label: '基础' }
]
},
subfolders: [
{
name: 'xianbag01',