搜索资源列表
求一个Dijkstra优化算法
- 求解一个最短路径问题程序，可以参考一下求一个Dijkstra优化算法！ 谢谢了 目的是求给定两点之间的最短距离 或者改一下我的程序也行 -shortest path to solve a problem of procedure, can seek a reference Dijkstra algorithm optimization! Thank you, the purpose is scheduled for 2:00 to the shortest distance be
Strassen_8
- Strassn关于两个矩阵相乘的算法，同过分治原理把两个n*n的矩阵阶各分解成四个n/2*n/2阶的矩阵，当分解出来的矩阵阶数等于2时，求借各个小矩阵，若阶数大与2，就递归的调用前面方法，直到分解成2*2的子矩阵为止。-Strassn on two matrix multiplication, the algorithm, with the governing principle over two n * n matrix of the band decomposed into 4 n / 2
short1
- 求最短路径的问题，用了回溯算法，内附说明 及调试 -seek the shortest path problem with the back algorithm, containing descr iptions and Debugging
critical_path
- 实现了关键路径算法。 给定一些点，并给定点间的路径的权值，求两点间的最短路径-achieve a critical path algorithm. Given some point and fixed-point to the right path of duty between 2:00 seek the shortest path
prime
- 快速求素数，用到了概率算法。可以求出相当大范围内的素数，远远优于普通的素数算法-Fast seek primes, using a probability algorithm. Can be obtained within the scope of a large prime number, which is far superior to an ordinary prime number algorithm
dijkstra
- 这是一个用c++开发的算法。 dijkstra算法用来求最短距离。-this is a arithmetic which is translated and edited by toubar c++. And dijkstra is a arithmetic for seek the lowest way from one place to another
random
- 含有随机算法，素数测试，求最近点对的随机算法-Contains a random algorithm, prime number test, seek the nearest point of the random algorithm
define_the_latter_table.txt
- 根据贪心算法，来求解最小生成树； 这种情况，可能求不不全局最优解，但是，可以求出当前情况下的最优解；-According to greedy algorithm to solve the minimum spanning tree this situation, it may not seek the global optimal solution is not, however, you can find the optimal solution under the current si
zuidaliu
- 用VC++6.0求算法分析设计中的最大流问题。-Using VC++6.0 analysis of algorithms designed to seek the maximum flow problem.
prim
- Prim算法用于求无向图的最小生成树. -Prim algorithm is used to seek an undirected graph of the minimum spanning tree
091017prim
- 用prim算法求最小生成树.C语言中关于图一章的很好的理解例子。对初学者很有用。-Seek the minimum spanning tree with the prim algorithm. C language on the map a good understanding of the chapter examples. Very useful for beginners.
mybestfeifengoverle
- 遗传算法求极值 体会遗传算法思想，能够设计并编写遗传算法的相关操作函数，并能够应用遗传算法求解具体问题。-Genetic algorithm genetic algorithms seek extremal understand ideas of genetic algorithms to design and prepare the relevant operational function, and be able to apply genetic algorithm to solve sp
zcggzc
- 用递归算法对输入的任意两个字符串求最长公共子串及其出现次数-Recursive algorithm to seek the input any two strings and the longest common substring occurrences
SmileKruskal
- 数据结构：数据结构课程设计可视化地实现KRUSKAL算法求最短路径-Data Structure: Data Structures course design visualization to achieve KRUSKAL seek the shortest path algorithm
closest_pair
- 求最近距离点对。包含o(nlgn)和o(n^2)复杂度算法-Seek nearest point pair. Contains o (nlgn) and o (n^2) complexity of algorithms
Dijkstra
- 简单的实现Dijkstra算法求最短路径，能输几个节点及各个节点的距离，然后算出中心节点与其他节点的最短路径。-Simple implementation Dijkstra algorithm seek shortest path, can lose several node and various node distance then calculated center node with other node shortest path.
Dynamic
- 求最长公共自序 列，动态规划算法求最长公共自序 列，动态规划算法 -Preface to seek the maximum demand up to the public from the public sequence, dynamic programming algorithm for getting up to the public from the sequence, dynamic programming algorithm for getting the longest sequen
Exp21_3
- 编写求二叉树的叶子结点数的函数模板。 [算法] 求一棵二叉树的叶子结点数的递归模型如下。 f(btree)=0 若为空树时 f(btree)=1 若只有根结点时,该根结点是叶结点-Leaves the preparation of the binary tree nodes seek the function template. [Method] request a binary tree leaf nodes of the recursive model is as
cpyb
- 移臂调度算法又叫磁盘调度算法，根本目的在于有效利用磁盘，保证磁盘的快速访问-The process of shifting the disk arm scheduling simulation system design- first come first serve method, the shortest seek time priority algorithm, Elevator algorithm
prime-test
- 素数测试问题（Monte Carlo算法） 求am(mod n)的算法(m≤n) 设m的二进制表示为bkbk-1…b1b0（bk=1,且k≈log2m）。 例：m=41=101001(2)，bkbk-1…b1b0=101001，（k=5）。 求am可以用下述方法：初始C←1。 -Prime number test problem ( Monte Carlo algorithm) Seek am ( MOD n ) algorithm ( M = n) A