-
huffmancode
哈夫曼编码程序，实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)
- 2008-01-14 13:55:11下载
- 积分：1
-
work1
讲解了循环单链表的建立，以及在链表中插入、删除、更改数据...(Explain the establishment of circular single linked list, and insert in the list, delete, change the data ...)
- 2010-10-03 11:00:45下载
- 积分：1
-
Classic-single-linked-list
单链表是C经典数据结构算法和数据结构，希望这对大家学习有点用(Classic single-linked list data structure in C algorithms and data structures, which we hope to learn a little bit with)
- 2011-08-02 12:33:26下载
- 积分：1
-
jiaotong
用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)
- 2013-03-23 13:06:49下载
- 积分：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
-
lovesmerging
游戏初始状态，假设有一段字母序列，其中任意三个相邻的字母不完全相同。游戏开始后，可以添加字母到所述序列的任意位置。一旦出现三个或更多相同的字母相邻，该连续子列就会消 除;如果一次消除发生后，新产生的序列再次满足消除条件，那么消除连锁发生，直到产生的序 列不再满足消除条件。一次输入后，连续消除的过程中，新字母不会产生;新的字母序列稳定 后，可以进行下一次操作。(The initial state of the game, assuming that there is a sequence of letters, where any three adjacent letters are not exactly the same. After the game starts, you can add letters to any position of the sequence. Once the three or more identical letters are adjacent, the consecutive sub-columns are eliminated; if the newly generated sequence satisfies the elimination condition again after a cancellation, the elimination of the chain occurs until the resulting sequence no longer satisfies the elimination condition The After a single input, the new letters are not generated during the continuous elimination process; after the new letter sequence is stable, the next operation can be performed.)
- 2017-10-27 21:37:04下载
- 积分：1
-
delete
删除数组中小于某个特定值的所有函数，或删除大于某个特定值的所有函数，或删除某一指定范围内的所有元素，用二叉树实现(Delete all functions in the array that are less than a particular value, or delete all functions that are larger than a particular value, or delete all elements within a specified range, with a binary tree)
- 2017-07-10 16:19:49下载
- 积分：1
-
MatchBracket
括号匹配的C语言工程实现，简单易懂，注释详细！更适合编程初学者学习！学习数据结构的最好资料！(Brackets match the C language engineering, easy-to-understand, detailed notes! More suitable for beginners to learn programming! Learning data structure best!)
- 2012-12-03 12:49:31下载
- 积分：1
-
box-nesting
最长d维箱嵌套问题的贪心算法，
采用贪心算法不能得到整体最优解,
但其最终结果也可以是最优解的很好的近似(The Greedy Algorithm of the Longest Nesting of d一Dimenson Boxes)
- 2012-06-11 16:47:23下载
- 积分：1
-
zuiyouerfenjiansuozhu
最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
- 2013-10-10 18:48:17下载
- 积分：1
