资源列表
Figure-and-its-application
- 用图来表示一个校园内各种地名（不少于10个），及其相对位置，实现校园内主要地点的遍历，并能求解任意两个地点之间的最短距离。-By using the picture to show a campus various places (not less than 10), and their relative positions, realize the main campus of the site traverse, and can solve any two place the shortes
zuoye
- 中 (1)增加一条弧 Addarc(adj,数据结构（第七章_图)作业： 题目描述：在有向图u,v) (2)删除一条弧 Delarc(adj,u,v)*-(1) add a arc Addarc (adj, data structures (Chapter VII _ Figure) operations: Title Descr iption: In a directed graph u, v) (2) Delete an arc
interval-tree
- a realization of interval tr-a realization of interval tree
text
- 输入N个点的坐标，判断这N个点能否构成一个凸多边形。-Enter the coordinates of N points, to determine whether the N points form a convex polygon.
Data-structure-course-design
- 上学期做的数据结构课程设计，走迷宫游戏，分别用了两种方法来实现： 第一种方法，链栈的存储结构，用递归的dfs来实现 第二种方法，回溯法求出所有通路，穷举求解法-On the data structure of the semester curriculum design, mazes game, respectively for the two methods to realize: The first method, chain stack the storage structur
GSP
- GSP算法的C++实现 GSP算法的C++实现 GSP算法的C++实现 GSP算法的C++实现 GSP算法的C++实现 -the C++ implement for GSP algorithm,it has been test by VS2010 and all right the C++ implement for GSP algorithm,it has been test by VS2010 and all right the C++ implement for GSP alg
BTree
- 用MFC实现二叉树的建立，前序中序后序遍历，求树高，叶子个数，交换左右子树，求结点个数，复制二叉树等-The establishment of a binary tree using MFC, after pre-order ininorder traversal order, seeking tree height, leaf number, exchange left and right subtrees, the number of demand nodes, copy the binar
queen
- 用MFC实现八皇后问题，可多皇后，比如四皇后、十六皇后等，可通过输入参数实现-Using MFC to solve eight queens problem, and more Queen, for example four Queens, sixteen Queen, etc., can be achieved through the input parameters
jifen
- 用C语言实现变步长复合梯形求积分，变步长辛普森法求积分，高斯法求积分。-In the C language realization become step length composite trapezoid for integral, become step length Simpson method for integral, gaussian method for integral.
Hash-table
- 哈希表 数据结构课程设计 1.1问题描述 针对自己的班集体中的“人名”设计一个哈希表，使得平均查找长度不超过R，完成相应的建表和查表程序。 1.2基本要求 假设人名为中国姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。构造哈希函数，用链表法处理冲突。 1.3测试数据 读取熟悉的30个人的姓名作测试。-Hash table Data Structure Course Design 1.1 Descr iption of the p
asb
- 哈希表设计 除留余数法构造 完整的查找 输出-hash for designing
DST
- 大二数据结构的实验，里面包含实验报告、源码、可执行文件，用VC++6.0开发的。动态查找表。功能齐全，实现 二叉排序树、平衡二叉树、B_树、2-3树、B+树。- Experimental sophomore data structures, which contains experimental reports, source code, executable file, using VC++6.0 development. Dynamic look-up table. F