-
0829-Binary-Tree
二叉搜索树的生成和查找节点，北大《数据结构与算法》教材的习题(The generation and find nodes of a binary search tree, Peking University, " Data Structures and Algorithms" textbook exercises)
- 2012-11-28 14:51:01下载
- 积分：1
-
C-yu-yan---pai-xu-
【最新编排】C语言中排序程序代码,此代码是从别处下载的，请参考(C yu yan zhong pai xu cheng xu dai ma)
- 2012-01-14 19:07:19下载
- 积分：1
-
Huffman
数据结构实验之哈夫曼算法，欢迎下载指正。带有可执行程序(Experimental data structure of the Huffman algorithm.Welcome to download correction.
With an executable program)
- 2013-12-07 20:58:01下载
- 积分：1
-
257
几个比较好的初级算法，初学者可以看一下思想，对算法入门(A few good elementary algorithms, beginners can look at thinking on algorithms entry)
- 2013-06-16 14:38:40下载
- 积分：1
-
stack
数据结构 堆栈 实现了以下功能：
cout<<"----------------主菜单---------------"<<endl
<<"* 1.建立 *"<<endl
<<"* 2.输出 *"<<endl
<<"* 3.判断栈是否为空 *"<<endl
<<"* 4.栈的长度 *"<<endl
<<"* 5.输出栈顶元素 *"<<endl
<<"* 6.进栈 *"<<endl
<<"* 7.出栈 *"<<endl
<<"* 8.遍历 *"<<endl
<<"* 9.数制转换 *"<<endl
<<"* 10.清空 *"<<endl
<<"* 11.销毁 *"<<endl
<<"* 12.退出 *"<<endl
<<"--------------------------------------"<<endl<<endl (data structure stack)
- 2013-11-01 11:05:10下载
- 积分：1
-
2007327
带权有向以及无向图的各种操作，适合数据结构初学者使用，是图那一章的重点(belt and the right to have no plans to the various operations, data structure suitable for beginners, is the chief focus of the chapter)
- 2007-04-22 23:49:54下载
- 积分：1
-
Ex1
从屏幕输入字符 判断括号匹配问题 数据结构作业(Judgment parenthesis matching data structure operations input characters from the screen)
- 2012-11-27 15:17:10下载
- 积分：1
-
实验2-简单计算器
北京理工大学信息与电子学院数据结构课程实验代码(Experimental code of data structure course of information and Electronics College of Beijing Institute of Technology)
- 2020-11-14 19:39:41下载
- 积分：1
-
041321239
电路板排列算法，是算法和数据结构分析里面非常经典的算法。用c＋＋实现(circuit board with algorithms, data structures and algorithms inside very classic analysis of the algorithm. Using C++)
- 2005-06-03 16:11:34下载
- 积分：1
-
4.2
基于dijkstra和广度搜索的加权有向图有必经点的点对点的最短路径算法，路径必须经过要求的必经点，且不成环。
该算法采用了一种自适应调整的方法，经过多次迭代，使解收敛。 但只是寻找了一个略优的可行解（每次迭代都基于贪婪算法寻找），不能保证最优解。而且如果图过于稀疏，因为收敛速度过快，可能导致问题无解（收敛于一个局部最优解，没有经过所有点）。 解决相对稠密的图（每个点的平均出入度4以上），表现良好。
备注：里面有一个QT的工程，可以直接打开（源码里没用QT的库）(Weighted Dijkstra and breadth first search based on a shortest path algorithm must point to point to the map, the path must pass through points, and not a ring.
This algorithm adopts an adaptive method to adjust, after several iterations, the convergence of solution. But only to find a slightly better feasible solution (each iteration is based on the greedy algorithm to find), can not guarantee the optimal solution. And if the graph is too sparse, because the convergence speed is too fast, it may lead to the problem of no solution (convergence to a local optimal solution, not after all points). To solve the relatively dense graphs (each entry point average above 4), good performance.)
- 2016-04-06 11:35:48下载
- 积分：1
