资源列表
Palindrome-judgment
- 回文判断的C++程序，迭代实现，很有参考价值-Palindrome judge C++ program, iterative implementation, a good reference value
dijkstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止-Dijkstra (Dijkstra) algorithm is a typical single source shortest path algorithm for computing a node to all other nodes of the shortest path. The main feature is the sta
ZPlayer
- C#音频播放器，能够实时播放wav音频。对初学者有帮助。 -C# audio player capable of playing wav audio in real time. Help for beginners.
rectangular-coordinates
- 能够实现极坐标到直角坐标的装换，对坐标运算，空间插值具有借鉴意义 。-It enables polar coordinates to rectangular coordinates installed for. .
the-maze-problem
- 功能：用递归方法实现对迷宫问题的求解。 内容说明：熟练递归特点；掌握递归与栈的关系。-Function: using recursive method to solve the maze problem. Content Descr iption: familiar with recursive characteristics master the relationship between recursion and stack.
basic-operation-of-guangyibiao
- 对广义表实现下列 4 种基本运算：（1）创建广义表；（2）遍历广义表；（3）求广义 表的深度；（4）求广义表的长度。-The following 4 basic operations of the generalized table: (1) create a generalized table (2) the ergodic generalized table (3) the depth (4) the length.
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