搜索资源列表
用动态规划算法思想求最小编辑距离
- 用动态规划算法思想求最小编辑距离，即近似字符串匹配问题,Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem
ACM_template.rar
- 本人参加ACM竞赛使用的一些算法模板，包括二分图匹配，欧拉回路的构造以及网络流中的最大流与最小费用最大流等，可以说实战性非常强。,ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and mini
Minimum-spanning-tree
- Kruskal算法和Prim算法 任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通). 加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和. 最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm Any edge of only by G, is composed of all the vertices containing G tree called G of the spannin
minimum-spanning-tree
- 使用C#图形界面生成最小生成树，核心算法使用Prim算法。图的形状可以在源文件中的图定义处修改。-C# graphical interface to generate a minimum spanning tree, the core algorithm using Prim algorithm. The graph shape defined in the source file in Figure modify.
graph
- 数据结构C对图的操作算法，有广度、深度优先遍历，拓扑排序，最短路径的实现算法，最小生成树的算法-C data structures to operate on the map algorithm, there is the breadth, depth-first traversal, topological sorting, shortest path algorithm, minimum spanning tree algorithm
minimal_spanning_tree(Prims)
- 最小生成树问题 问题描述：若要在ｎ个城市之间架设通讯网络，只需要架设ｎ－１条线路即可。如何以最低的经济代价建设这个通讯网，是一个网的最小生成树问题。 设计要求：利用Prims算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network between cities, only need to
prim
- 自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。-Own, and in VB in the minimum spanning tree algorithm prim implementation code, there is graph, edge weights are randomly generated, five nodes, point " generate tree" ,
zuixiaoshengchengshu
- 这是一个关于数据结构中最小生成树的源代码，是课程作业。-This is data about the structure of a minimum spanning tree of the source code, programs are operating.
MST
- Minimum Spanning Tree implementation using kruskal and prims algorithm.
K-degree-constrained-minimum-spanning-tree
- 本压缩包完整地实现了最小可度限制生成树的算法程序，代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete.
KRUSKAL
- * create a forest F (a set of trees), where each vertex in the graph is a separate tree * create a set S containing all the edges in the graph * while S is nonempty and F is not yet spanning o remove an edge with minimum weight from S o
Minimum-spanning-tree
- 网的邻接矩阵存储（数组表示）、简单输出，最小生成树，采用Prim算法实现最小生成树。-Network adjacency matrix storage (array representation), a simple output, minimum spanning tree, minimum spanning tree using Prim algorithm.
ACM_code
- ACM常用算法，内容涵盖了如快速傅里叶变换，求排列组合数，判断图形是凸集还是凹集，求解模线性方程，求最小生成树等算法-ACM commonly used algorithms, covering, such as fast Fourier transform, find the number of permutations and combinations to determine the graph is convex or concave set of linear equations so
Minimum-weight-vertexCoverProblem
- 最小权顶点覆盖问题，C++完成，模块化实现函数功能-Minimum weight vertex cover problem, C++ to complete, modular feature implementation function
Minimum-spanning-tree
- 这是数据结构中的最小生成树的实现方法。通过运行可以得到最小生成树。-This is the data structure is the realization method of minimum spanning tree. By running can get minimum spanning tree.
minimum-expansion-of-two-strings
- 算法设计类源代码。使用动态规划的方式计算两个字符串的最小扩展距离。-Algorithm design class source code. Calculated using dynamic programming the minimum expansion of the distance of two strings.
cut-the-minimum-cut-problem
- cut 最小割问题 网络G=(V,E)的割cut(S,T)是将G的顶点集V划分为2个不相交的子集S和T，使s Î S ， t Î T ，且cut(S,T) = {(u,v)Î E | u Î S,vÎ T}。设每条边(u,v)的边权为a(u,v),则割 cut(S,T)的权值为cut(S,T)中所有边权之和。最小割问题要求网络G 的权值最小的割。-cut the minimum cut problem network G = (V, E)
minimum-spanning-tree
- 本程序用Kruskal算法构造最小生成树，注释详细并附带调试结果-Creating a minimum spanning tree with the Kruskal algorithm.
Minimum-spanning-tree
- 最小生成树的生成与演算 分为普利姆算法和克鲁斯卡尔算法-Minimum spanning tree
Minimum-spanning-tree
- 已知一个无向网，求该网的最小生成树，该程序使用的是克鲁斯卡尔算法，求的的最小生成树-A no known to the nets, for the nets minimum spanning tree, the program is using cruise Carl algorithm, and of the minimum spanning tree