资源列表
zuizhong
- 一个完整的HHT程序，需要先下载EMD工具箱-A complete HHT program, you need to download the EMD Toolbox
dijkstra1
- dijkstra算法很简短。很核心的算法，核心代码10行。-dijkstra algorithm
dp-algorithm
- 经典算法——动态规划教程，很详细的教程资料，长达70多页，很好很强大。-Classical algorithm- dynamic programming tutorial, a very detailed tutorial information as long as 70 pages, very very powerful.
huffman
- huffman树的数据结构实现代码 ，挺全面的。-Huffman tree data structure code, very comprehensive.
Dijkstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法是很有代表性的最短路径算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。Dijkstra一般的表述通常有两种方式，一种用永久和临时标号方式，一种是用OPEN, CLOSE表的方式，这里均采用永久和临时标号的方式。注意该算法要求图中不存在负权边。 -Dijkstra (Dijkstra)
Dijkstra-alg
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。本算法时间复杂度完全符合要求。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm, is used to calculate a node to all other nodes in the shortest path. The main features is the startin
Sorts
- 排序算法，插入排序，折半排序，快速排序，希尔排序-Sorting algorithm, insertion sort, binary sort, quick sort, Hill sorting
The-matrix-the-chain-multiplication-
- 运用动态规划思想，解决矩阵链最优算法问题。-The use of dynamic programming to solve the problem of the optimal matrix chain algorithm.
The-longest-common-subsequence
- 运用动态规划思想和策略，解决最长公共子序列问题。-The use of dynamic programming ideas and strategies to solve the longest common subsequence problem.
single-list
- 单链表实现代码，各种操作：数据插入，删除，显示等-Single linked list implementation code, a variety of operations: data insertion, deletion, display
min-heap
- 采用C++语言完成的程序设计课程作业，实现最小堆算法，附带演示程序-C++ language program design course to achieve the minimum heap algorithm, along with the demo program
lab02
- 此文件是有关线性表顺序存储结构上所有功能的实现，例如构造空表、销毁或重置、元素个数、插入以及删除、返回值的实现等。-This file is the linear table stored in the order structure all functions are implemented, such as empty table structure, destroyed, or reset, the number of elements, insert, and delete, the r