GAD_Tool:数据结构可视化的小型学习工具-开源
该工具专为 TUM 的主题“基础知识：算法和数据结构”而设计。 目的是提供一个涵盖整个材料范围的视觉测试和学习环境。 该项目是在 2012 年学期休假期间开始的，并在几周内升级到当前的功能以进行修订课程。 由于主要关注点是“它应该可以工作”，因此目前没有文档。 特点： - 逐步处理所有算法 - 排序算法 - 动态数组 - 二叉堆和二项堆 - AVL 树 - (a, b) 树 - 规划中的散列： - 图形 - O 符号 重要说明：即使这个程序应该展示一些众所周知的算法和数据结构是如何高效实现的，这些没有高效实现，主要是由于逐步可视化的局限性
文件下载
资源详情
[{"title":"（ 61 个子文件 83KB ） GAD_Tool:数据结构可视化的小型学习工具-开源","children":[{"title":"GAD","children":[{"title":"GAD.sln <span style='color:#111;'> 851B </span>","children":null,"spread":false},{"title":"GAD","children":[{"title":"CreateHashtable.cs <span style='color:#111;'> 2.54KB </span>","children":null,"spread":false},{"title":"Program.cs <span style='color:#111;'> 502B </span>","children":null,"spread":false},{"title":"CreateExtSort.resx <span style='color:#111;'> 5.68KB </span>","children":null,"spread":false},{"title":"CreateAVLTree.resx <span style='color:#111;'> 5.68KB </span>","children":null,"spread":false},{"title":"Parser","children":[{"title":"NodeType.cs <span style='color:#111;'> 355B </span>","children":null,"spread":false},{"title":"Parser.cs <span style='color:#111;'> 10.15KB </span>","children":null,"spread":false},{"title":"Node.cs <span style='color:#111;'> 14.42KB </span>","children":null,"spread":false}],"spread":true},{"title":"app.config <span style='color:#111;'> 159B </span>","children":null,"spread":false},{"title":"CreateSort.Designer.cs <span style='color:#111;'> 15.39KB </span>","children":null,"spread":false},{"title":"CreateBinaryHeap.resx <span style='color:#111;'> 5.68KB </span>","children":null,"spread":false},{"title":"CreateABTree.Designer.cs <span style='color:#111;'> 7.18KB </span>","children":null,"spread":false},{"title":"CreateAVLTree.Designer.cs <span style='color:#111;'> 5.08KB </span>","children":null,"spread":false},{"title":"GAD.csproj <span style='color:#111;'> 9.64KB </span>","children":null,"spread":false},{"title":"MainWindow.Designer.cs <span style='color:#111;'> 9.32KB </span>","children":null,"spread":false},{"title":"CreateDynArray.Designer.cs <span style='color:#111;'> 12.38KB </span>","children":null,"spread":false},{"title":"CreateBinaryHeap.cs <span style='color:#111;'> 1.98KB </span>","children":null,"spread":false},{"title":"CreateDynArray.resx <span style='color:#111;'> 5.68KB </span>","children":null,"spread":false},{"title":"ToDo.txt <span style='color:#111;'> 396B </span>","children":null,"spread":false},{"title":"CreateBinomialHeap.Designer.cs <span style='color:#111;'> 4.97KB </span>","children":null,"spread":false},{"title":"CreateDynArray.cs <span style='color:#111;'> 4.25KB </span>","children":null,"spread":false},{"title":"GAD.csproj.user <span style='color:#111;'> 478B </span>","children":null,"spread":false},{"title":"CreateABTree.resx <span style='color:#111;'> 5.68KB </span>","children":null,"spread":false},{"title":"CreateAVLTree.cs <span style='color:#111;'> 1.97KB </span>","children":null,"spread":false},{"title":"CreateExtSort.Designer.cs <span style='color:#111;'> 6.32KB </span>","children":null,"spread":false},{"title":"Versions Log.txt <span style='color:#111;'> 967B </span>","children":null,"spread":false},{"title":"CreateExtSort.cs <span style='color:#111;'> 1.67KB </span>","children":null,"spread":false},{"title":"MainWindow.cs <span style='color:#111;'> 5.19KB </span>","children":null,"spread":false},{"title":"CreateSort.resx <span style='color:#111;'> 5.68KB </span>","children":null,"spread":false},{"title":"Datastructures","children":[{"title":"HashtableChaining.cs <span style='color:#111;'> 4.20KB </span>","children":null,"spread":false},{"title":"MergeSort.cs <span style='color:#111;'> 2.83KB </span>","children":null,"spread":false},{"title":"ExtSort.cs <span style='color:#111;'> 5.96KB </span>","children":null,"spread":false},{"title":"HashtableProbing.cs <span style='color:#111;'> 6.04KB </span>","children":null,"spread":false},{"title":"BubbleSort.cs <span style='color:#111;'> 1.95KB </span>","children":null,"spread":false},{"title":"BinomialTree.cs <span style='color:#111;'> 2.35KB </span>","children":null,"spread":false},{"title":"BinaryHeap.cs <span style='color:#111;'> 5.06KB </span>","children":null,"spread":false},{"title":"ABNode.cs <span style='color:#111;'> 4.20KB </span>","children":null,"spread":false},{"title":"DynArray2.cs <span style='color:#111;'> 6.79KB </span>","children":null,"spread":false},{"title":"SelectionSort.cs <span style='color:#111;'> 2.79KB </span>","children":null,"spread":false},{"title":"HashtableCokcoo.cs <span style='color:#111;'> 7.03KB </span>","children":null,"spread":false},{"title":"BinaryTree.cs <span style='color:#111;'> 8.61KB </span>","children":null,"spread":false},{"title":"DataStructure.cs <span style='color:#111;'> 3.57KB </span>","children":null,"spread":false},{"title":"DynArray.cs <span style='color:#111;'> 6.81KB </span>","children":null,"spread":false},{"title":"ABTree.cs <span style='color:#111;'> 18.77KB </span>","children":null,"spread":false},{"title":"InsertionSort.cs <span style='color:#111;'> 2.03KB </span>","children":null,"spread":false},{"title":"AVLTree.cs <span style='color:#111;'> 9.90KB </span>","children":null,"spread":false},{"title":"BinomialHeap.cs <span style='color:#111;'> 6.55KB </span>","children":null,"spread":false}],"spread":false},{"title":"CreateSort.cs <span style='color:#111;'> 3.41KB </span>","children":null,"spread":false},{"title":"MainWindow.resx <span style='color:#111;'> 22.43KB </span>","children":null,"spread":false},{"title":"CreateHashtable.resx <span style='color:#111;'> 5.68KB </span>","children":null,"spread":false},{"title":"CreateBinaryHeap.Designer.cs <span style='color:#111;'> 4.96KB </span>","children":null,"spread":false},{"title":"Properties","children":[{"title":"AssemblyInfo.cs <span style='color:#111;'> 1.58KB </span>","children":null,"spread":false},{"title":"Settings.Designer.cs <span style='color:#111;'> 1.10KB </span>","children":null,"spread":false},{"title":"Resources.resx <span style='color:#111;'> 5.48KB </span>","children":null,"spread":false},{"title":"Settings.settings <span style='color:#111;'> 249B </span>","children":null,"spread":false},{"title":"Resources.Designer.cs <span style='color:#111;'> 2.99KB </span>","children":null,"spread":false}],"spread":false},{"title":"CreateHashtable.Designer.cs <span style='color:#111;'> 9.62KB </span>","children":null,"spread":false},{"title":"CreateABTree.cs <span style='color:#111;'> 2.08KB </span>","children":null,"spread":false},{"title":"CreateBinomialHeap.cs <span style='color:#111;'> 2.05KB </span>","children":null,"spread":false},{"title":"Icon1.ico <span style='color:#111;'> 1.05KB </span>","children":null,"spread":false}],"spread":false},{"title":"GAD.suo <span style='color:#111;'> 84.00KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}]
评论信息
其他资源
- 国科大模式识别与机器学习作业2018最新版
- 30进制计数器.zip
- matlab 两种自适应数值积分算法
- 模拟四方COM_103设备
- 计算机网络课程设计（编写UDP客户/服务器程序）
- Matlab GUI 串口调试助手(window32位/64位支持) ， 解决64位GUI“创建控件失败”的报错。
- 摩托罗拉 GR1225B 写频软件
- 社区活动：有关社区聚会，研讨会和纪念活动的所有信息-源码
- 为我们的世界建模
- 抓包文件转成H264的工具
- STM8最全C实例
- 浙江科技学院土木工程材料试题.pdf
- 行动中的flink：行动中的flink-源码
- usbkill：«usbkill»是一种取证杀伤开关，它等待USB端口的更改，然后立即关闭计算机。-源码
- 北方交通大学硕士研究生入学考试试题土力学2004.rar
- 13-DMA—直接存储区访问.rar
- 网络工程备考笔记.txt
- UI界面设计文档，详细设计文档
- thumbnailator-0.4.8.jar
- 一个用c#文件流写的通讯录
- C++基础与提高-王桂林(第二版)
- OpenGL 雾化效果
- 点对点文件传输课程设计
免责申明
【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【只为小站】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明