资源列表
Floyd
- Floyd 算法，创建有向图，无向图，有向网，无向网的算法-Floyd algorithm, create a directed graph, undirected graph, directed networks, undirected networks algorithm
kruskal
- 利用克鲁斯卡尔算法求边集数组GE所示图的最小生成树-Order to Kruskal algorithm using an array of GE edge set of minimum spanning tree as shown in Figure
Prime
- Prime 算法，创建有向图，无向图，有向网，无向网的算法-Prime algorithms, to create a directed graph, undirected graph, directed networks, undirected networks algorithm
simpler
- Simpler程序，迭代，速度压力，半隐式，比simple收敛快-Simpler procedures, iteration, velocity pressure, semi-implicit, converges faster than the simple
average
- 一个计算平均分数，应用好的算法，提供了运行速率-get the average of some numbers with a good algorithm
Joseph
- 以visual studio 2005为开发环境的约瑟夫环设计。-Environment: visual studio 2005
a
- 算法分析，此教程介绍一些常用的算法，比如回溯法，-failed to translate
code_encode
- 这是一个编码解压密码的小程序，初学者下下来，对你编码有好处-This is an encoded password extracting a small program for beginners under the down is good for you code
kruskal
- kruskal算法_POJ 1258代码-kruskal algorithm _POJ 1258 code
huiwenshu
- 回文数的判断，用栈和队列做的！希望大家可以互相交流一下-Palindrome number of judgments, with stacks and queues to do! Hope that we can exchange what
include
- 定义一个栈，并实现栈的基本操作： void Push( const T& x) // bool Pop(T& x) // bool getTop(T& x) const // ostream& operater<<(ostream& os, Stack<T>& s) //overload -The definition of a stack, and to achieve the basic operation of the stack: void P
fzjx
- 货郎担问题的分支限界算法，速度很快，并且结点可以到达35个-The branch and bound algorithm for traveling salesman problem, very fast, and the node can reach 35