搜索资源列表
longest
- 输入一个带权图的无向图，求出其中一个顶点到其它顶点最长的路径，并输出这条最长路径-input with a map without the right to plan, which sought a vertex to vertex other the longest path, and the output of the longest path.
longest-common-string
- 这是动态规划中，求最长公共子序列（Longest common string）的源代码。自己编写执行。程序简单，有注释。
longest common substring
- 该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the comple
longest common substring
- 该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the comple
Hough变换的源程序
- Hough变换用来在图象中查找直线。它的原理是：假设有一条与原点距离为s，方向角为θ的一条直线，直线上的每一点都满足方程 s=x*Cosθ+y*Sinθ，利用这个事实，我们可以找出某条直线来。这段程序，用来找出图象中最长的直线。-Hough Transformation is used for searching lines in an image . Here is the principle: Assume there is a
longest
- 输入一个带权图的无向图，求出其中一个顶点到其它顶点最长的路径，并输出这条最长路径-input with a map without the right to plan, which sought a vertex to vertex other the longest path, and the output of the longest path.
Dijkstra
- 求数组最长递增子序列算法。输入一个数组，输出其最大递增子序列-Array for the longest increasing subsequence algorithm. An array of input and output its maximum incremental sequence
lcs
- 算法实现题 最长公共子序列问题 给定两个序列 X = { x1 , x2 , ... , xm } Y = { y1 , y2 , ... , yn } 求X和Y的一个最长公共子序列 举例 X = { a , b , c , b , d , a , b } Y = { b , d , c , a , b , a } 最长公共子序列为 LSC = { b , c , b , a }-Algori
LCS(c++)
- LCS Algorithm, this is a c++ code for lcs(Longest Common Subsequence)
4
- 最长公共子序列算法的实现,还有实验报告，欢迎大家下载-The longest common sub-sequence algorithm, as well as experimental reports, welcomed everyone to download
longest-common-string
- 这是动态规划中，求最长公共子序列（Longest common string）的源代码。自己编写执行。程序简单，有注释。-This is a dynamic planning, seeking the longest common sub-sequence (Longest common string) the source code. The preparation of the implementation of their own
LCS
- 使用动态规划方法,实现了最长公共子序列算法,并对动态规划方法作了时间和空间的改进-The use of dynamic programming methods, to achieve the longest common sub-sequence algorithms, and dynamic programming methods of time and space to improve
longest
- 给出一个由非0整数组成的序列a1,a2,…,an, 设计递归算法求其中由同号整数组成的最长连续段(称为最长同号连续段)的长度。-Given a non-0 component of the sequence of integers a1, a2, ..., an, the design of recursive algorithm for one by the same integer number consisting of the
lcs
- LCS Longest (maximum) common subsequence -LCS Longest (maximum) common subsequence
longest
- Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where
DP
- 最长路径DP算法 根据邻近矩阵,再运用DP算法计算出图中任意节点间的最长路径,有点类似于最短路径算法-DP algorithm for the longest path in accordance with the neighboring matrix, re-use of DP algorithm to calculate arbitrary graph the longest path between nodes, somewh
1977+Algorithms+for+the+Longest+Common+Subsequence
- 最长子序列,英文版,电子书 ACM文章1977+Algorithms+for+the+Longest+Common+Subsequence+Problem-The longest sequence, in English, e-books ACM article 1977+ Algorithms+ For+ The+ Longest+ Common+ Subsequence+ Problem
longest
- 这是暑假写的最长公共子序列算法，呵呵， 欢迎大家来下载-Writing This is the longest summer vacation of public sequence algorithm, huh, huh, welcome everyone to download
TheLongestCommonSubsequence
- 本代码是用c#来实现最长公共子序列算法。-The c# code is used to achieve the longest common sub-sequence algorithm.
lcs
- Longest Common Subsequence Problem. Solution both Iterative and Recursive.