搜索资源列表
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 line whoes direction is \"sit
分项案例
- 找到邮件列表文件中前十个最长的邮件地址，并排序输出到文件result.txt中-mailing list to find documents before the 10 longest-mail addresses and sort the output to a file which result.txt
导游图
- 用c语言实现的导游图，有图形界面，支持鼠标操作，使用dfs和floyd算法实现给出两点间最短路和最长路。-used language guides map, a graphical interface, mouse support operation, use dfs and Floyd algorithm is the shortest path between two points and the longest path.
repeat
- 最长重复子串问题 .问题描述： 在一个特定字符串str 中，多次出现的子串称为重复子串。如果字符串str 中有多个重复 子串，则其中长度最长的子串称为最长重复子串。例如，str=’abcdacdac’ ，则子串’cdac’ 是str 的最长重复子串。 .编程任务： 给定一个字符串str ，编程计算str 的最长重复子串。-longest repeated substrings problems. Problem descr iption : In
HW2.rar
- we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic programming.,we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic pro
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
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.
project1
- Constrained LCS. Given two sequences X, Y and a constrained sequence P, a sequence Z is a constrained longest common subsequence for X and Y with respect to P if Z is the longest subsequence of X and Y such that P is a subsequence of Z.
LMIS
- 动态规划求解最长单调递增子序列，给出了图形界面-Dynamic programming to solve the longest monotonically increasing subsequence given the graphical user interface
xulie
- 利用动态规划法求解次最长公共子序列问题。-The use of dynamic programming method for solving second longest common subsequence problem.
longest
- 求两个子序列是最长公共子序列并输出到文件中。input.txt中的格式为X={A,B,C,D},Y={B,D}。-Find two sub-series is the longest common subsequence and output to a file. input.txt in the form X = {A, B, C, D}, Y = {B, D}.
The-longest-word-in-the-output
- 这个程序写了如何从一堆字符串中找到最长的字符，对C/C++初学者很有帮助-This program written characters, C/C++ beginners helpful from a bunch of string to find the longest
The-longest-common-subsequence-
- 最长公共子序列问题 第一步 最优子结构: 第二步：建立递归式 第三步：计算最优值 -The longest common subsequence problem
longest-word
- 输入一串字符串，求出其中最长的单词。仅限于英文字符串，且有字符长度限制。-Enter a bunch of strings, find the longest word. English only strings, and there is a character length limit.
Longest-Prefix
- the solution to the usaco problem Longest prefix
The-longest-common-substring
- 最长公共子串，包括一个动态规划法的两个字符串最长公共子串的计算，和多个字符串最长公共子串的C代码-Longest common substring, including two strings of a dynamic programming method of computing the longest common substring, and multiple string longest common substring of C code
Longest-common-substring
- 求两个输入序列的最长的公共子字符串的长度。子字符串中的所有字符在源字符串中必须相邻。-Length of the input sequence is the sum of two longest common substring. Substring of all the characters in the source string must be contiguous.
Longest-Palindromic-Substring
- //动态规划求最长回文子串 //用布尔型t[i][j]表示子串（s(i....j))是否为回文子串 //其中t[i][j]的值可通过t[i+1][j-1]的值以及是s[i]和s[j]是否相等判断（即子串（s(i...j))是否为回文子串可通过子问题s（i+1,...,j-1)是否为回文串来解决） //通过left和right来指示当前最长回文子串的下标-// Dynamic programming longest palindrome substring // Boolean t
Longest-Palindromic-Substring
- Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.