资源列表
huffman
- 大学数据结构编程实验 C++ 哈夫曼编码与解码 文件输入输出-University of C data structures programming experiments Huffman encoding and decoding input and output files
kebiao
- JAVA 基于拓扑排序的排课程序,山大数据结构课程设计，相关大学请勿直接引用。-JAVA SOURCE CODE TOPU COURSES-SORT
rpn
- 中缀式变后缀式的代码。经典逆波兰式算法。-Reverse Polish notation
priorityQueue
- 利用二叉树实现的优先级队列类，包含了基本的入队，出队操作，减小键值等功能，可作为数据结构学习之用。-The priority queue class is implemented using binary tree. The fundamental function includes enqueue, dequeue, decrease key, etc.
2010211307-2-24
- 假设稀疏矩阵A和B均以三元组表作为存储结构，试写出矩阵相加(相乘—选做)的算法，另设三元组表C存放结果矩阵。 矩阵相加测试实例： 0 7 0 8 0 2 0 1 0 0 A= 4 0 0 0 5 B= 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 6 0 6 0 0 -6 0 处理过程提示： 输入稀疏矩阵A和B 检测A和B能否相加 矩阵相加运算 打印运算结果-Sparse matrix A and B are in
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