登录
首页 » Visual C++ » KMP---MFC

KMP---MFC

于 2020-07-04 发布 文件大小:4205KB
0 108
下载积分: 1 下载次数: 35

代码说明:

  数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)

文件列表:

KMP算法MFC版
............\Debug
............\.....\KMP.exe,110666,2012-03-21
............\.....\KMP.ilk,195324,2012-03-21
............\.....\KMP.obj,12946,2012-03-21
............\.....\KMP.pch,5500452,2012-03-21
............\.....\KMP.pdb,353280,2012-03-21
............\.....\KMP.res,2876,2012-03-21
............\.....\KMPDlg.obj,31923,2012-03-21
............\.....\StdAfx.obj,105704,2012-03-21
............\.....\vc60.idb,205824,2012-03-21
............\.....\vc60.pdb,364544,2012-03-21
............\KMP.APS,36224,2012-03-21
............\KMP.clw,1350,2012-03-21
............\KMP.cpp,2021,2012-03-20
............\KMP.dsp,4105,2012-03-20
............\KMP.dsw,514,2012-03-20
............\KMP.h,1291,2012-03-20
............\KMP.ncb,74752,2012-03-21
............\KMP.opt,53760,2012-03-21
............\KMP.plg,674,2012-03-21
............\KMP.rc,5813,2012-03-21
............\KMPDlg.cpp,6208,2012-03-20
............\KMPDlg.h,1416,2012-03-20
............\ReadMe.txt,3525,2012-03-20
............\Release
............\.......\KMP.exe,20480,2012-03-20
............\.......\KMP.obj,8747,2012-03-20
............\.......\KMP.pch,5686020,2012-03-20
............\.......\KMP.res,2880,2012-03-20
............\.......\KMPDlg.obj,19384,2012-03-20
............\.......\StdAfx.obj,750,2012-03-20
............\.......\vc60.idb,50176,2012-03-20
............\res

............\...\KMP.rc2,395,2012-03-20
............\resource.h,911,2012-03-20
............\StdAfx.cpp,205,2012-03-20
............\StdAfx.h,1054,2012-03-20

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • algorithm
    一本介绍各种算法的经典书籍,计算机算法设计与分析(A classic book introduces a variety of algorithms, algorithm design and analysis of computer)
    2011-08-08 22:13:02下载
    积分:1
  • vbsort
    vb实现的排序算法演示vb实现的排序算法演示.冒泡、选择、折半等多种排序算法(vb sort demodemodemodemodemovb sort demodemodemodemodemo)
    2011-10-09 10:21:28下载
    积分:1
  • test12
    约瑟夫问题,用数据结构的循环链表实现约瑟夫问题的解答(Joseph problems,30 people in a circle, and inspires us with a circular chain to said. Can use structure array to make a cycle chain. The structure has two members, one for pointing down a pointer to a circular chain )
    2012-05-14 10:29:52下载
    积分:1
  • 9
    说明:  任意给定输入的一个小写英文字符串a1a2a3…an-1an (n≥5) 输出:字符串Ana1An-1a2An-2a3…A2an-1A1an,其中Ai为ai的大写形式 例如,输入aybdx,则递归程序输出XaDyBbYdAx (Any given input of a lowercase string a1a2a3 ... an-1an (n ≥ 5) Output: the string Ana1An-1a2An-2a3 A2an-1A1an, which Ai ai uppercase for example, input aybdx recursive program output XaDyBbYdAx)
    2012-05-30 10:59:39下载
    积分:1
  • hash
    使用全排列实现hash,看看吧相信对大家会有些帮助的(Full array hash)
    2011-08-19 21:25:34下载
    积分:1
  • migongproduce
    迷宫生成器,可以根据需要自己建立各类型的迷宫,而且能求解出线路(Maze maze of various types of generators, according to the needs its own, but also to solve the lines)
    2012-02-10 15:17:36下载
    积分:1
  • Figure-topological-sort
    说明:  拓扑排序   对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。   通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意:   ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。   ②若图中存在有向环,则不可能使顶点满足拓扑次序。   ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
    2011-03-22 17:19:14下载
    积分:1
  • GraphTheory
    讲述数据机构的图论部分和程序设计的关系,适合学习算法的同学学习阅读,很不错的一本书。(Graph theory algorithm and programming)
    2013-12-04 20:12:39下载
    积分:1
  • tu
    说明:  、实验目的 1 熟练掌握各种内排序方法,深刻理解排序算法及其执行过程; 2 学会分析各种内排序算法的性能; 3 了解各种排序方法的优缺点,对于实际问题能够选择一种较好的排序方案; 4 熟练掌握图的存储结构; 5 掌握图的邻接矩阵和邻接表表示分别进行深度和广度优先搜索遍历的算法。 6 了解图的最小生成树算法。 (Proficiency in the order of search, binary search and index search basic search algorithm, these algorithms are familiar with what kind of storage structure suitable for implementation two master binary sort tree characteristics, building methods, and dynamic search algorithm 3 master hash table of characteristics and construction methods.)
    2009-12-30 21:15:29下载
    积分:1
  • Online_RandMarkingAlgorithm
    本程序解决的是:模拟类似计算机主、缓存的存储结构,当用户请求某个页面时,若某个页面已在缓存中,则直接从缓存中去取,不会产生失误(即未在缓存中命中),否则,就到主存中去取,代价变大。 本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)
    2012-09-19 13:01:47下载
    积分:1
  • 696524资源总数
  • 103930会员总数
  • 47今日下载