资源列表
Dijkstras-algorithm
- Let the node at which we are starting be called the initial node. Let the distance of node Y be the distance from the initial node to Y
Fibonacci
- 斐波那契数的三种方法性能比较，分别是矩阵法，自底向上法和直接递归法-three fibonacci methods
sushuhuan
- 用VC++做的一个素数环程序，采用的数据结构师栈-With VC++ to do a prime ring program, teachers use the data structure stack
flight
- 应用类模板，链表写的航班系统，可以写入要定的航班及姓名，然后有查找和删除功能-Application class template, write the list of flight systems, flight can be written to and given the name, then find and delete functions are
10suanfadaquan
- 10个经典的算法 包含多种经典的算法，例如 树，图，-10 contains many classic classical algorithms algorithms, such as trees, graphs, etc.
mataqipan
- 基于数据结构中栈的方法，通过入栈，出栈来实现 马踏棋盘的这个功能-Stack data structure based on the method, through the stack, the stack to implement this feature horse riding board
yiyuanduoxiangshi
- 数据结构的一元多项式的加减乘除法的运算，仅供学习。-Data structure of a polynomial addition and subtraction multiplication and division operations, for learning.
kruskal
- K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选取的边若产生环路则不可能形成一棵生成树-K ruskal algorithm each time you select n-1 edges, using criteria of greed: from the left side, select a loop with no minimum spend has been selected to
prim
- 算法简介:Prim算法用于求无向图的最小生成树 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。 其算法的时间复杂度为O（|E|log|V|）-Introduction to Algorithms: Prim algorithm used to find the undire
1234xianxu_zhongxu
- 输入一个树的先序遍历和中序遍历，然后输出这棵树。-Enter a preorder traversal of the tree and in-order traversal, then the output tree.
ACMsuanfa
- ACM 经典算法大集合 ACM 经典算法大集合 ACM 经典算法大集合-A large collection of classic algorithms ACM ACM ACM large collection of classical algorithms a large collection of classical algorithms ACM large collection of classic algorithms
uuy
- 最优化问题之一的算啊与代码 多级安全中敏感标记的最优化挖掘 C++算法与分析-Optimization problem with one count ah multi-level security code in the most sensitive marker of the C++ algorithms to optimize mining and analysis