-
hafumanTree
数据结构课程设计,在VC环境下完成,利用哈夫曼树原理,主要功能是实现字符的压缩和解压缩,设计脉络清晰,易懂(Data structure course design, completed in the VC environment, using Huffman tree principle, the main function is to achieve the character of the compression and decompression, design, clear structure, easy to understand)
- 2011-01-02 13:15:23下载
- 积分:1
-
list-and-array
数组的定义与使用,数组的运算,字符串的输入与输出,冒泡排序(list and array)
- 2013-10-17 11:32:30下载
- 积分:1
-
bstree_frame
利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)
- 2013-08-10 16:43:50下载
- 积分:1
-
nuaa1108
说明: nuaa1108 多少连续的1 解题报告(Problem solving report
)
- 2009-08-23 10:01:05下载
- 积分:1
-
Test6
最短路径算法。
用无向带全图的邻接矩阵存储图,确定从源点出发到其它各点的最短路径。
输入:图中包含的顶点数n 边数m, 各边权值,用邻接矩阵或者邻接表存储。
输出:源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)
- 2014-05-11 17:05:37下载
- 积分:1
-
Numbersequence
说明: 简单的数据结构算法 在POJ上的题目 利用C++实现(Simple data structure algorithm in POJ on the subject using C++ Implementation)
- 2010-05-04 19:03:45下载
- 积分:1
-
SeqQueue
数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
- 2013-06-15 16:27:32下载
- 积分:1
-
Kruskal
采用Kruskal算法求最小生成树主要数据结构
edgeset GE 存放图中的所有边
int n,int e 存放图中的顶点数与边数
edgeset C 存放生成树中的边
vexlist gv 图中结点的顶点值
adjmatrix s 用来处理图中结点的查找与合并
int m1,m2 一条边上两顶点所属集合的序号
int k 最小生成树中的边数
int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)
- 2011-05-17 10:22:56下载
- 积分:1
-
Well-tested-algorithm
效验算法单循环链表,这些都是实用经典的算法和数据结构(Well-tested algorithm round robin list, these are practical classic algorithms and data structures)
- 2011-08-02 12:20:21下载
- 积分:1
-
chechang
数据结构作业-停车场管理(operating data structure-the car park management)
- 2020-06-26 11:00:02下载
- 积分:1