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}]
评论信息
其他资源
- eCPRI接口协议，中英文对应版
- 轮接触点迹线及轮轨接触几何参数的计算
- 知识图谱语义搜索
- 算法实验凸包枚举、Graham-Scan、分治三种解决方法
- 逆透视变换matlab 代码
- OpenGL 立体房子模拟
- 转差频率控制的的电机仿真模型
- 音像出租管理系统（c#）
- 宠物自动喂食器
- Levenberg-Marquardt(LM)优化算法 求解非线性方程组
- 安卓表白程序-附源码
- SQLPrompt 9.4 防止注册失效
- opencv人脸检测训练用到的正样本图像
- DICOM 协议中文版 1-6 部分 完整版
- [FPGA][DE2-EP2C35F672C6](WM8731)音频输入->ADC->FPGA->DAC->音频输出
- C# 反编译工具ILSpy
- 高斯-瑞利混合模型在遥感图像分割中的应用
- 修改盒子机器码
- Xamarin官方教程
- 下行法求故障树最小割集
- PostgreSQL_与_MS_SQLServer比较
- TMS320F28335和F2812原理图库和PCB库文件(Altium Designer)
- 双击可编辑单元格的ListControl控件
- 基于harris角点特征的图像配准程序
免责申明
【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【只为小站】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明