资源列表
Studymeterialsfordatastructure
- 数据结构课件（[数据结构(C语言版)].严蔚敏.吴伟民.课件.第04章-串，第05章-数组和广义表，第06章-树和二叉树，第07章-图，第08章-动态存储管理，第09章-查找）-Study meterials for data structure (C language version). Weimin Yan&Weimin Wu . Including: Chapter 04- strings Chapter 05- arrays and generalized list
TopSort
- Programming Technique课程assignment 1，输入一组关系组，然后查找到所有相容的偏序。-Programming Technique course assignment 1, enter a relationship group, and then find all compatible partial order.
myheard
- 数据结构的课程设计,计算一元稀疏距阵的计算器-the data structure of a curriculum design, calculation of one yuan sparse matrix of calculators
Vector
- 仿照STL Vector实现的向量（变长数组）类-STL Vector modeled implement vector (variable length arrays) class
VonConfig
- 各种数据结构处理类，方便对各种数据结构进行分析和管理，同时支持文件存储-Any structure of data, you can using to manage data and support export to file.
sequence-list
- 实现对该顺序表的遍历。 ,在顺序表中进行顺序查找某一元素,查找成功则返回其存储位 ,实现在顺序表的第i个位置上插入一个元素x的算法。 实现删除顺序表中第i个元素的算法。 有序表插入算法建立一个有序表的函数。 实现输入一个元素x,把它插入到有序表中,使顺序表依然有序。-To achieve the order of the traversal table. , In the order of the table to find an element in
sequence-list2
- 实现对该顺序表的遍历。 ,在顺序表中进行顺序查找某一元素,查找成功则返回其存储位 ,实现在顺序表的第i个位置上插入一个元素x的算法。 实现删除顺序表中第i个元素的算法。 有序表插入算法建立一个有序表的函数。 实现输入一个元素x,把它插入到有序表中,使顺序表依然有序。-To achieve the order of the traversal table. , In the order of the table to find an element in
Huffmancode
- 着先通过 HuffmanTree() 函数构造哈夫曼树，然后在主函数 main()中自底向上开始(也就是从数组序号为零的结点开始)向上层层判断，若在父结点左侧，则置码为 0,若在右侧,则置码为 1。最后输出生成的编码-The first HuffmanTree () function to construct Huffman tree, and then main () main () the bottom up (that is, the array number zero node) t
bign
- 计算大整数的头文件，支持加减乘除，流，次方，开方，求余，小于，大于，不等于等运算。-Calculation of large integer header files to support the addition and subtraction multiplication and division, flow, power, square root, seeking more than, less than, greater than, not equal to other operatio
8puzzle_dfs
- 实现了八数码问题，运用了图搜索中的DFS（深度优先搜索）。-翻译 实现了八数码问题，运用了图搜索中的DFS（深度优先搜索）。 The implementation of the eight digital issues, the use of the map search DFS (depth-first search).
code2
- Package consists of 3 codes. First,to Print huffman decoding tree given.Second, to find top level view of a tree. Third, A reviewer rates the two challenges, awarding pointsfor three categories.We define the rating for two person s challenge to be th
code3
- Package consists of 3 files. First, to compare two linked list. Second, to find the reverse of a linked list using recursion. Third , to merge two sorted linked list