搜索资源列表
e2
- 是一款用vc++编写的计算levshtein距离的程序.也就是可以做time alignment,计算两个文档之间最小的距离(插入,删除,替换的最小次数)-is a preparation using vc levshtein distance calculation procedures. It is time to do alignment, the two documents between the calculated minimum distance (insertion, delet
普利姆最小生成树
- 用普利姆算法实现最小生成树，简单的排序算法。对学习很有帮助-with minimum spanning tree algorithm, a simple algorithm. The study helpful
最小费用最大流1
- 本文用Ｃ语言实现了优化算法－最小费用最大流算法，主要用于图论领域-Using C programming language, the optimization algorithm-minimum cost maximum flow algorithm, mainly for the field of graph theory
greedy_three
- 用贪心算法求最小生成树的问题是可以由这个程序来实现的。它求出在一棵树中哪些边组成的通路具有最小的权值。-with greedy algorithm for the minimum spanning tree problem can be resolved by this procedure to achieve it. It obtained in a tree in which the edge of the pathway with minimum weight.
GraphVc7
- 先输入图的各顶点名，再输入图的邻接矩阵从而建立图，并用笛施卡尔，普里姆等三种方法求其最小生成树，-input vertices of the plan, and plans to import the adjacency matrix thereby establishing map, and use flute Shi Carl prim other three methods for the minimum spanning tree,
tree
- 最小生成树 算法 利用二叉树原理生成最小生成书 数据结构实验-Principle of minimum spanning tree algorithm uses a binary tree data structure generated experimental Smallest Book
prim
- 数据结构课程设计，prim算法求最小生成树，给出了所有可能的生成树-Data structure course design, prim algorithm for minimum spanning tree, has given all the possible spanning tree
deleteminelem
- 删除最小节点，相同的最小节点也能删除，在C++中用数据结构进行实现-Remove the smallest node, the same minimum node can also delete the C++ data structures used to achieve
MiniEXE
- Console界面的程序，演示如何构造一个最小大小的程序，主代码仅void main(){},演示了如何使此代码编译出1K大小的程序。-Console interface procedures, demonstration of how to construct a minimum size of the procedure, the main code void main (){}, only demonstrated how to make this code compile a 1K si
wendoshidukongzhiqi
- 1.具有低温上电和高温断电功能； 2.能够进行温度上限和温度下限设置，并且实时显示温度； 程序内以给出详细注释.-1. With a low temperature and high temperature power-off function 2. To carry out the minimum temperature and maximum temperature settings, and real-time display of temperature proces
minimum
- minimum spanning tree problem, kruskal and prim algorithms.Program gets matrix as an input
prim
- 依据prim最小生成树的算法实现的最小生成树源码，能够建立准确的最小代价生成树-Prim minimum spanning tree based on the minimum spanning tree algorithm source code, be able to establish an accurate minimum cost spanning tree
lefttree
- 最小左偏树的合并算法，是自己在学习数据结构的时候写的。-Minimum left side tree merging algorithms, data structures own time in learning to write.
heapsort
- 堆排序(HeapSort)是一树形选择排序。堆排序的特点是：在排序过程中，将R[l..n]看成是一棵完全二叉树的顺序存储结构，利用完全二叉树中双亲结点和孩子结点之间的内在关系(参见二叉树的顺序存储结构)，在当前无序区中选择关键字最大(或最小)的记录-Heap Sort (HeapSort) is a tree selection sort. Heap sort is characterized by: the sort process, the R [l.. N] as a complete b
prio
- 优先队列是0个或多个元素的集合,每个元素都有一个优先权或值,对优先队列执行的操作有1) 查找 2) 插入一个新元素 3) 删除.在最小优先队列(min priorityq u e u e)中,查找操作用来搜索优先权最小的元素,删除操作用来删除该元素 对于最大优先队列(max priority queue),查找操作用来搜索优先权最大的元素,删除操作用来删除该元素.优先权队列中的元素可以有相同的优先权,查找与删除操作可根据任意优先权进行. -Priority queue is 0 or mor
SteinerGADlg
- Steiner Genetic Algorithm. Genetic Algorithm used to search for maximum/minimum value of a given function using the concept of chromes and genes.
subway-exchange-system
- 地铁换乘系统，以北京地铁线路为例，求最少换乘线路，采用深度搜索的方式。-Subway transfer system to the Beijing subway line, for example, seeking a minimum transfer line, using the depth search.
rates
- 一个能源供应问题的c++源代码，需要调用CPLEX优化软件。- Assume you run a power supply company. You have several power generators // available, each of which has a minimum and maximum production level and a // cost per unit output. The question is which generators to u
Shortest
- 数据结构实验内容 最小生成树程序设计-Minimum spanning tree
Minimum-cost-maximum-flow-algorithm
- 最大流最小费用算法-Minimum cost maximum flow algorithms. . . . . . . . . . . . . . .