资源列表
(最大和问题)
- 求一个矩阵的最大和，并判断两个矩阵的最大和-seek a matrix of the largest and, to judge two of the largest and Matrix
duoxiaingadd
- 数据结构常用的算法，实现多项式相加的，供大家参考-data structure commonly used algorithm, and the sum of the polynomial, for your reference
dijkstra
- 个人完成的dijkstra algorithm例程．直接读取文本文件并完成计算．设置为最大可读５１２点．
MST_without input
- kruscal的源代码，实现最小生成树的算法，这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process.
PeriodicScriptBACKUP
- ABAQUS周期性边界条件fortran代码，适合添加周期性边界条件-ABAQUS fortran code of the periodic boundary conditions, suitable for adding the periodic boundary conditions
11
- 建立有向图邻接表 潘一帆制作 数据结构小作业-The establishment of digraph adjacency list data structure潘一帆produced a small operating
liandulie
- 该程序描述 了一个链队列结构 -.................................
00
- 约瑟夫环数据结构实训内容 大学计算机专业实训内容-Joseph ring data structure the content of University Computer Training Professional Training Content
maopaopaixu
- 自己写的几种能够实现的冒泡排序算法，希望能对需要的朋友有所帮助，是C++的-Some write their own bubble sort algorithm can be achieved, hoping to help a friend in need is a C++,
splay-tree
- 划分树logn 给你n个数 然后让你query从ll到rr中排第k的数-N logn to you by the number of trees and then let you query from ll to rr in the number of rank k
huffman
- Huffman 编码 已知：信源符号个数q、信源符号s0, . . . , sq?1，信源概率分布p0, . . . , pq?1。 算法： (a) 如果q = 2 则返回编码：s0 7! 0, s1 7! 1 (b) 否则 i. 重新排序s0, . . . , sq?1 和p0, . . . , pq?1 ii. 创建一个符号s′，其概率为p′ = pq?2 + pq?1 iii. 递归调用本算法以得到s0, . . . , sq?3, s′ 的编码w0, . .
dynamic-programming
- 使用c++语言，在vs2008平台上编写，用动态规划法求解0，1背包问题-C++ language use, in vs2008 platform to write, with the dynamic planning solution 0, 1 knapsack problem