Search - edit - CodeBus

Search - edit - List

[Data structs] 编辑距离问题 DL : 0: 此算法也是非常常用的算法之一,在这个算法中我们特别要明白编辑距离问题的实质所在.-This algorithm is very commonly used algorithm, the algorithm in particular, we need to understand edit distance the real problem lies.
Date : 2025-12-24 Size : 6kb User : 周华
[Data structs] LocateElem DL : 0: /* shiyan.c 第四组数据结构实验作业。Author:zhg 功能：本程序用于验证函数 LocateElem(L,e,compare()) 。即求出现行表中元素的位序。程序中的线性表采用顺序存储，以更方便于该操作的实现。 */ -/* shiyan.c fourth group structure of the experimental data. Author : zhg function : This procedure is used to validate function LocateElem (L, e, compare ()). Calculated that the existing table spaces sequence elements. Procedures using the linear sequence of storage, in a more convenient to the realization of the operation.* /
Date : 2025-12-24 Size : 12kb User : zhg
[Data structs] EditDistance DL : 0: 用动态规划算法思想求最小编辑距离，即近似字符串匹配问题-Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem
Date : 2025-12-24 Size : 1kb User : Doreen
[Data structs] xsxxglxt DL : 0: 编写一个学生管理系统，每个学生应该包含如下信息：地址，出生日期，学科成绩（语文，英语，数学，物理），个人信息（姓名，性别，民族，国籍，学历），联系方式（手机，家庭电话，学校电话）可以任意添加学生，删除学生，编辑学生信息，并且具有保存和读入学生信息的功能。-The preparation of a student management system, each student should include the following information: address, date of birth, academic performance (language, English, mathematics, physics), personal information (name, gender, ethnicity, nationality, education), contact information (phone, home phone, school phone) can add students, delete students, edit student information, and has preserved and read into the function of student information.
Date : 2025-12-24 Size : 337kb User : 路斯洛夫斯基
[Data structs] edit DL : 0: 数据结构课程设计 ---文章编辑原代码数据结构课程设计 ---文章编辑原代码-wenzhangbianji数据结构课程设计---文章编辑原代码
Date : 2025-12-24 Size : 1kb User : 石头
[Data structs] middlg DL : 0: 1. 建立一个基本对话的exe工程，并命名为circle； 2. 插入一个对话框资源，以在此对话框上输入圆心坐标、半径及颜色，并为此建立一个新类，命名为CDlg； 3. 在IDD_CIRCLE_DIALOG上删除已有控件，并添加一个Button，命名为Button1； 4. 在CcircleDlg内添加3个double型成员变量，命名为x，y，r，然后添加1个COLORREF的成员变量，命名为color； 5. 在CDlg内加入3个Edit box，在加入一个button2； 6. 在CDlg内用classwizard为3 个Editbox添加3个double型成员变量，命名为m_x，m_y，m_r，然后添加1个COLORREF的成员变量，命名为color1； 7. 用classwizard为button2添加消息响应函数void CDlg::OnButton2()，在此函数内输入下列代码 CColorDialog m if(m.DoModal()==IDOK) color=m.GetColor() 8. 为此Button1添加一个消息响应函数void CCircleDlg::OnButton1()，在此函数内输入下列代码 CDlg dl dl.DoModal() x=dl.m_x r=dl.m_r -The accuracy of the algorithm is affected by the slope, if the slope is greater than 2, then a straight line can be observed as dotted lines, the slope is greater than one of the most perfect.
Date : 2025-12-24 Size : 1.62mb User : tmacq3
[Data structs] shujujiegou DL : 0: 文章编辑程序可以统计出文字，数字，空格的个数。静态存储一页文章，每行最多不超过80个字符，共n行-article edit
Date : 2025-12-24 Size : 18kb User : 小罗
[Data structs] L_A_distance DL : 0: Levenshtein 距离算法实现。Levenshtein 距离测量两个字符串的相近性-The "Levenshtein distance" is a measure of the similarity between two strings, this algorithm is also refered to as "edit distance".
Date : 2025-12-24 Size : 19kb User : peter
[Data structs] database DL : 0: Simple database for 2-5 person. You can store name, lastname and phone number and edit in any way. For student which start with C++ language.
Date : 2025-12-24 Size : 1kb User : keny
[Data structs] 1132813581 DL : 0: 算法导论书上的动态规划---编辑距离的实现-algorithm==== edit distance
Date : 2025-12-24 Size : 1kb User : parhat
[Data structs] distanceEdition DL : 0: 用动态规划的方法来实现的编辑距离问题。没了-Using dynamic programming methods to achieve the edit distance problem. Gone
Date : 2025-12-24 Size : 1kb User : killer
[Data structs] Data_struct_2 DL : 0: 数据结构课后设计题第二章(2009-06-17 23:19:42)转载标签：数据结构第二章杂谈分类：编程 ◆2.11② 设顺序表L中的数据元素递增有序。试写一算法，将x插入到L的适当位置上，并保持该表的有序性。要求实现下列函数： void InsertOrderList(SqList &L, ElemType x) 顺序表类型定义如下： typedef struct { ElemType *elem int length int listsize } SqList -Data structure design question after class II (2009-06-17 23:19:42) reproduced Tags: Chapter topics for classification of data structures: programming ◆ 2.11 ② based order form elements of L in increasing order of data. Try to write a method, the L x inserted into the proper position and keep the table ordered. Required to achieve the following functions: void InsertOrderList (SqList & L, ElemType x) the order of the table type definition is as follows: typedef struct (ElemType* elem int length int listsize ) SqList
Date : 2025-12-24 Size : 4kb User : M.T
[Data structs] p2 DL : 0: program that uses a tree to store words, different things could be done to change, remove, or edit a word in a document
Date : 2025-12-24 Size : 4kb User : eugenetoddbro
[Data structs] Map22 DL : 0: 一个基于VC的有向无环图操作实例源代码，图的节点可以使任意可插入OLE项，在编辑一栏，您可以插入节点、删除节点、拓扑排序、广度遍历、最短路径、插入边等操作，该程序作者是中国地质大学的姜景捷。 -A VC' s are based on directed acyclic graph operation source code examples, graph nodes can be inserted into OLE can make any entry in the Edit column, you can insert node, delete node, topological ordering, breadth traversal, shortest path, into the side, etc. operation of the program Jiangjing Jie of China University of Geosciences.
Date : 2025-12-24 Size : 27kb User : madud00091
[Data structs] LD DL : 0: 又称Levenshtein距离（也叫做Edit Distance），是指两个字串之间，由一个转成另一个所需的最少编辑操作次数。许可的编辑操作包括将一个字符替换成另一个字符，插入一个字符，删除一个字符。 -Also known as Levenshtein distance (also known as Edit Distance), is between two strings, one by one turned into the minimum required number of editing operations. Editing operation permit include replacing one character to another character, insert a character, delete a character.
Date : 2025-12-24 Size : 171kb User : zdl
[Data structs] tdistance-stringlabel DL : 0: 计算任意两棵树结构间的编辑距离，是Zhang和Shasha提出来的，时间复杂度为O(V*V *min(L, D)*min(L , D -compute the edit distance between two tree structures, it s proposed by Zhang and Shasha , time complexity is O(V*V *min(L, D)*min(L , D ))
Date : 2025-12-24 Size : 4kb User :
[Data structs] sourse DL : 0: 数据结构之线性表，实现插入，删除，编辑，遍历，查找等功能-Linear table data structure to achieve insert, delete, edit, traverse, search and other function
Date : 2025-12-24 Size : 37kb User : kuange
[Data structs] EditPDistance DL : 0: edit distance.字符串之间编译距离，包括插入，删除，替换。 -edit distance
Date : 2025-12-24 Size : 1kb User : yy
[Data structs] Pattern-matching DL : 0: 串的模式匹配问题.这在数据结构课本中占有一席之地。它可用于文件编辑-The string pattern matching problem plays an important role in the data structure.It can be used to edit text.
Date : 2025-12-24 Size : 4kb User : zhangyue
[Data structs] edit-distance DL : 0: 算法导论(3)动态规划中edit distance 一题解答-Introduction to Algorithms (3) dynamic programming in an edit distance Answers
Date : 2025-12-24 Size : 2kb User : xiazhao

« 12 »