基于群体智能的知识图谱构建学习平台，相关数据集

{"name": "数据结构", "author": "吴勇", "email": "[email protected]", "datetime_created": "2023-11-08 21:45:38.0000", "configuration": {"edge_config": [{"type": "实例", "names": [{"name": "是一个", "value": "例如：李刚==是一个==>人"}]}, {"type": "分类", "names": [{"name": "是一种", "value": "例如：鸟==是一种==>动物"}]}, {"type": "成员", "names": [{"name": "是一员", "value": "例如：张强==是一员==>共青团"}]}, {"type": "包含", "names": [{"name": "是一部分", "value": "例如：黑板==是一部分==>墙壁"}, {"name": "实现", "value": "例如：分治==实现==>"}]}, {"type": "相近", "names": [{"name": "相似", "value": "例如：红黑树==相似==Splay树"}]}, {"type": "属性", "names": [{"name": "解决", "value": "能够解决哪些实际问题"}, {"name": ["概述", "简介", "介绍"], "value": "介绍该实体的相关信息"}, {"name": "时间复杂度", "value": "描述该算法或数据结构的时间复杂度，例如：O(N)"}, {"name": "空间复杂度", "value": "描述该算法或数据结构的空间复杂度，例如：O(N^2)"}]}]}, "entities_connections": {"nodes": [{"id": "动态规划", "label": "动态规划"}, {"id": "贪心", "label": "贪心"}, {"id": "枚举", "label": "枚举"}, {"id": "思维", "label": "思维"}, {"id": "分治", "label": "分治"}, {"id": "二分", "label": "二分"}, {"id": "数论", "label": "数论"}, {"id": "字符串", "label": "字符串"}, {"id": "排序", "label": "排序"}, {"id": "搜索", "label": "搜索"}, {"id": "最小生成树", "label": "最小生成树"}, {"id": "最短路径", "label": "最短路径"}, {"id": "递归", "label": "递归"}, {"id": "最近公共祖先", "label": "最近公共祖先"}, {"id": "区间dp", "label": "区间dp"}, {"id": "树形dp", "label": "树形dp"}, {"id": "线性dp", "label": "线性dp"}, {"id": "状态压缩dp", "label": "状态压缩dp"}, {"id": "01背包", "label": "01背包"}, {"id": "完全背包", "label": "完全背包"}, {"id": "多重背包", "label": "多重背包"}, {"id": "分组背包", "label": "分组背包"}, {"id": "二分查找", "label": "二分查找"}, {"id": "质数筛法", "label": "质数筛法"}, {"id": "最大公约数", "label": "最大公约数"}, {"id": "Eratosthenes筛法", "label": "Eratosthenes筛法"}, {"id": "线性筛法", "label": "线性筛法"}, {"id": "更相减损术", "label": "更相减损术"}, {"id": "欧几里得算法", "label": "欧几里得算法"}, {"id": "字符串hash", "label": "字符串hash"}, {"id": "KMP算法", "label": "KMP算法"}, {"id": "选择排序", "label": "选择排序"}, {"id": "插入排序", "label": "插入排序"}, {"id": "交换排序", "label": "交换排序"}, {"id": "基数排序", "label": "基数排序"}, {"id": "桶排序", "label": "桶排序"}, {"id": "归并排序", "label": "归并排序"}, {"id": "简单选择排序", "label": "简单选择排序"}, {"id": "堆排序", "label": "堆排序"}, {"id": "简单插入排序", "label": "简单插入排序"}, {"id": "希尔排序", "label": "希尔排序"}, {"id": "冒泡排序", "label": "冒泡排序"}, {"id": "快速排序", "label": "快速排序"}, {"id": "图的遍历", "label": "图的遍历"}, {"id": "树的遍历", "label": "树的遍历"}, {"id": "拓扑排序", "label": "拓扑排序"}, {"id": "深度优先搜索", "label": "深度优先搜索"}, {"id": "广度优先搜索", "label": "广度优先搜索"}, {"id": "剪枝", "label": "剪枝"}, {"id": "A*", "label": "A*"}, {"id": "IDA*", "label": "IDA*"}, {"id": "中序遍历", "label": "中序遍历"}, {"id": "先序遍历", "label": "先序遍历"}, {"id": "后序遍历", "label": "后序遍历"}, {"id": "层序遍历", "label": "层序遍历"}, {"id": "迭代加深", "label": "迭代加深"}, {"id": "记忆化", "label": "记忆化"}, {"id": "Prim算法", "label": "Prim算法"}, {"id": "Kruskal算法", "label": "Kruskal算法"}, {"id": "单源最短路径", "label": "单源最短路径"}, {"id": "多源最短路径", "label": "多源最短路径"}, {"id": "Dijkstra算法", "label": "Dijkstra算法"}, {"id": "SPFA/Bellman-Ford算法", "label": "SPFA/Bellman-Ford算法"}, {"id": "Floyd算法", "label": "Floyd算法"}, {"id": "向上标记", "label": "向上标记"}, {"id": "树上倍增", "label": "树上倍增"}, {"id": "Tarjan算法", "label": "Tarjan算法"}, {"id": "线性结构", "label": "线性结构"}, {"id": "非线性结构", "label": "非线性结构"}, {"id": "线性表", "label": "线性表"}, {"id": "堆栈", "label": "堆栈"}, {"id": "单调栈", "label": "单调栈"}, {"id": "队列", "label": "队列"}, {"id": "循环队列", "label": "循环队列"}, {"id": "双端队列", "label": "双端队列"}, {"id": "hash散列表", "label": "hash散列表"}, {"id": "顺序表", "label": "顺序表"}, {"id": "链表", "label": "链表"}, {"id": "图", "label": "图"}, {"id": "有向图", "label": "有向图"}, {"id": "无环图", "label": "无环图"}, {"id": "有向无环图", "label": "有向无环图"}, {"id": "树", "label": "树"}, {"id": "邻接表", "label": "邻接表"}, {"id": "邻接矩阵", "label": "邻接矩阵"}, {"id": "关联矩阵", "label": "关联矩阵"}, {"id": "多叉树", "label": "多叉树"}, {"id": "二叉树", "label": "二叉树"}, {"id": "并查集", "label": "并查集"}, {"id": "Trie字典树", "label": "Trie字典树"}, {"id": "Huffman树", "label": "Huffman树"}, {"id": "完全二叉树", "label": "完全二叉树"}, {"id": "线段树", "label": "线段树"}, {"id": "树状数组", "label": "树状数组"}, {"id": "二叉查找树", "label": "二叉查找树"}, {"id": "平衡二叉搜索树", "label": "平衡二叉搜索树"}, {"id": "Treap树", "label": "Treap树"}, {"id": "splay树", "label": "splay树"}, {"id": "FHQTreap树", "label": "FHQTreap树"}, {"id": "二叉堆", "label": "二叉堆"}, {"id": "最小堆", "label": "最小堆"}, {"id": "最大堆", "label": "最大堆"}, {"id": "单源最短路径问题", "label": "单源最短路径问题"}, {"id": "多源最短路径问题", "label": "多源最短路径问题"}, {"id": "树的直径", "label": "树的直径"}, {"id": "Google十大热门关键词的排序", "label": "Google十大热门关键词的排序"}, {"id": "富豪排行榜", "label": "富豪排行榜"}, {"id": "LCS最长公共子序列", "label": "LCS最长公共子序列"}, {"id": "LIS最长上升子序列", "label": "LIS最长上升子序列"}, {"id": "银行排队问题", "label": "银行排队问题"}, {"id": "畅通工程问题", "label": "畅通工程问题"}, {"id": "建设道路数量问题", "label": "建设道路数量问题"}, {"id": "最低成本建设问题", "label": "最低成本建设问题"}, {"id": "最大子列和问题", "label": "最大子列和问题"}, {"id": "表达式求值", "label": "表达式求值"}, {"id": "多项式加法运算", "label": "多项式加法运算"}, {"id": "迷宫问题", "label": "迷宫问题"}], "edges": [{"source": "枚举", "type": "实现", "target": "冒泡排序"}, {"source": "枚举", "type": "实现", "target": "简单选择排序"}, {"source": "枚举", "type": "实现", "target": "简单插入排序"}, {"source": "枚举", "type": "解决", "target": "最大子列和问题"}, {"source": "思维", "type": "解决", "target": "最大子列和问题"}, {"source": "分治", "type": "实现", "target": "快速排序"}, {"source": "分治", "type": "实现", "target": "归并排序"}, {"source": "分治", "type": "解决", "target": "最大子列和问题"}, {"source": "二分", "type": "实现", "target": "二分查找"}, {"source": "递归", "type": "实现", "target": "归并排序"}, {"source": "递归", "type": "实现", "target": "线段树"}, {"source": "递归", "type": "实现", "target": "快速排序"}, {"source": "递归", "type": "实现", "target": "深度优先搜索"}, {"source": "区间dp", "type": "是一种", "target": "动态规划"}, {"source": "树形dp", "type": "解决", "target": "树的直�