资源列表
00011
- 数据结构 表达式求值 有控制台模式和界面模式（C++）两种 已测试通过-Expression evaluation data structures and interfaces with console mode mode (C++) have been tested two kinds of
00012
- 数据结构 找迷宫出口 迷宫存储在数组中，运行后自动找到出口已经出迷宫路径 已测试通过-The maze to find the maze exit data structure stored in the array, run automatically to find the export has been out of the maze paths have been tested
shujujiego
- 数据结构算法代码，c语言实现，常用的所有算法，包括链表，队列，图，树-Data structure algorithm code, c language implementation, common to all algorithms, including linked lists, queues, graphs, trees
sorting
- 此程序是数据结构中常见的几种排序实现，包括堆排序，插入选择排序等-This program is a data structure of several common sorting achieved, including the heap sort, insertion sort, etc. options
Multi-classSVMClassifierUtilizingBinaryDecisionTre
- 有关svm 多类的问题，用二叉树来解决的。一篇英文。可以参考。-The svm multi-class problems, and use a binary tree to be resolved. One in English. Can refer to.
Create_and_bianli_BiTree
- c语言实现的 算法思想： 根据完全二叉树的定义，对完全二叉树按照从上到下，从左到右的层次序遍历应该满足： （1）某节点没有左孩子，则一定无右孩子 （2）某节点缺左或右孩子，则其所有后继一定无孩子。 若不满足上述任何一条，均不为完全二叉树。 (3) 利用栈先序遍历 -c language implementation of the algorithm is thinking: According to the definition of complete binary
feidigui_bianli_BiTree
- 建立一棵链表表示的二叉树，然后采用非递归先序访问二叉树，具体用一个指针栈(数组)来实现，且其最大容量为maxsize=50，二叉树根指针为T，若一个结点的左孩子和右孩子均为空，则为叶子结点，计数器加一，直到访问结束。-Binary tree expressed in the establishment of a linked list, and then visit the first-order non-recursive binary tree, specifically with a po
chanru_paixu
- c语言实现的插入算法 用直接插入法对用户输入的顺序表进行排序 先建立一个顺序表，再直接插入排序 -c language implementation of the insertion algorithm using the direct insertion method of the order entered by the user sort the table must be built on a sequence table, and then directly into th
Manual
- 本课件是一个动态演示数据结构算法执行过程的辅助教学软件, 它可适应读者对算法的输入数据和过程执行的控制方式的不同需求, 在计算机的屏幕上显示算法执行过程中数据的逻辑结构或存储结构的变化状况或递归算法执行过程中栈的变化状况。整个系统使用菜单驱动方式, 每个菜单包括若干菜单项。每个菜单项对应一个动作或一个子菜单。系统一直处于选择菜单项或执行动作状态, 直到选择了退出动作为止。-This courseware is a dynamic data structure algorithms demonst
ALGO-08
- strassen matrix mutliplication based on the combination of matrix multiplication algorithm for a 4 by 4 matrices-strassen matrix mutliplication based on the combination of matrix multiplication algorithm for a 4 by 4 matrices
finddepth
- 集合算法，最优二分搜索树，最长公共子序列，union—find算法的应用与推广-Collection algorithm, the optimal binary search tree, the longest common subsequence, union-find algorithm of the application and promotion of
random
- 含有随机算法，素数测试，求最近点对的随机算法-Contains a random algorithm, prime number test, seek the nearest point of the random algorithm