资源列表
netaddressd
- 计算网络地址 计算子网掩码地址 计算 各种子网的地址-Computing network address The subnet mask address calculation In calculating the subnet address
erchashu
- 创建二叉树数据结构,c++程序及相关文章资料-Create a binary tree data structure, c++ program and information related articles
fraktal-strom
- fraktal tree, fraktal tree, fraktal tree, fraktal tree, fraktal tree, -fraktal tree, fraktal tree, fraktal tree, fraktal tree, fraktal tree, fraktal tree, fraktal tree, fraktal tree, fraktal tree, fraktal tree,
zuixiaoercheng
- 多步最小二乘法是一种参数辨识的基本方法-Multi-step method of least squares is a basic parameter identification. . . . . . . .
cqjxe
- 多數大小排列 可輸入多 M數字 M行大小排序 為初 W者迴圈應用的 M A()
oulalujingbianli
- 通过欧拉路径计算非叶子节点的后代数目，并且先序遍历输出构造的二叉树-Eulerian path through the calculation of non-leaf node the number of generations, and output first traversal of the binary tree structure
5091209073_2
- 编写一个程序要求用户输入一段文字，然后按照每个单词的开头字母对这段文字分类统计单词的数量并排序输出。（sjtu 二专 作业2）-Write a program that requires the user to input a paragraph of text, and then follow the first letter of each word on the statistics of this text and sort out the number of words. (Sjtu
dijkstra
- dijkstra算法的matlab实现，验证数据采用了河北省主要城市的赋值无权网络图，并分析了单程往复式行驶的效率因素，实际应用价值高-the dijkstra algorithm matlab to achieve, verify the data used in major cities in Hebei Province network has no right of assignment, and an analysis of the efficiency of one-way reci
zhaolingqian
- 本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.
c_yuanma
- c语言关于数据结构的全部代码，在vc环境下做的-c language data structure on all of the code, in vc environment do
qishizouri
- 数据结构作业，利用队列实现骑士走日算法，计算出在方格内能否在一定步数之内达到目的地-Data structure operations, the use of the queue to go on to achieve knight algorithm to calculate whether the box within a certain number of steps to reach the destination
fzxj
- 分支限界法解决单源最短路径问题(xiaodan)-Branch and bound method to solve the single source shortest path problem (xiaodan)