资源列表
ClosestNodePairs
- 这是最接近点对问题，分别使用了分治算法和穷举法求解最接近点对。-it is the closest point of the problem, namely the use of a divide-and-conquer method and exhaustive closest point right.
Floyd-A
- Floyd最短路径算法的VC7.0试验成功！可以计算2点间的最短路径。-Floyd shortest path algorithm VC7.0 success of the test! 2:00 calculating the shortest path.
CRC16CRC32CRC16F
- CRC16CRC32CRC16F算法和代码-CRC16CRC32CRC16F algorithm and the code
CRC_CCC++
- CRC算法原理及C语言实现-CRC algorithms for C Language
changzhengshuxiajia
- 用户输入2个任意长整数，求它们的加法，减法和乘法，并将结果显示；-two user input arbitrarily long integers, for the addition, subtraction and multiplication, and the results show;
kmphebf
- ＢＦ和ＫＭＰ算法实例，曾经的作业，希望对你有点帮助-BF and KMP algorithm example, once the operation, and I hope to you a little help
topu
- 输入有向图的顶点，又有优先级的要求，通过此程序可以得到一个合理的排序-importation plan to the apex, another priority of the request, through this procedure can be a reasonable sort of
Poly---6yunsuan
- 可以实现两多项式的加减乘除及微积分运算，但因当时时间关系，没有对多项式进行有效性进行检查-can achieve the two polynomial arithmetic operations and calculus, but for the time, no right polynomial validity checks
2-sou-suo
- 分别用快速排序和分治算法对随机产生的200个数进行排序-respectively quicksort algorithm and the partition of the 200 randomly generated number Sort
lineartriangleassemble
- 此程序完成有限元计算中的总体合成功能,可用于任何使用有限元的情况-FEM calculation of the overall combined functions can be used for any use of the Finite Element
060624
- 图遍历的演示 设图的结点不超过30个，每个结点用一个编号表示（如果一个图有n个结点，则它们的编号分别为1,2,…,n）。通过输入图的全部边输入一个图，每个边为一个数对，可以对边的输入顺序作出某种限制-traverse the map-based presentation of the plan node is not more than 30, each node with a No. said (if a plan with n nodes, they were the No.
060625
- 用C实现的二叉树的建立与遍历希望大家喜欢-C achieved with the establishment of a binary tree traversal hope you like