登录
首页 » Visual C++ » bracketmatching

bracketmatching

于 2013-01-21 发布 文件大小:31KB
0 226
下载积分: 1 下载次数: 2
我要下载

代码说明：

  这个程序用来解决树结构与树之间的程序匹配的问题这个程序可以解决很多的问题(it is very good)

文件列表：

bracketmatching
...............\bracketmatching.cpp,3049,2010-09-13
...............\bracketmatching.vcproj,3667,2010-09-13
...............\bracketmatching.vcproj.SYLVIA.Cheng Yong.user,1409,2010-12-20
...............\bracketmatching.vcxproj,4725,2011-09-27
...............\bracketmatching.vcxproj.filters,940,2011-09-27
...............\bracketmatching.vcxproj.user,143,2011-09-27
...............\Debug
...............\.....\bracketmatching.Build.CppClean.log,1319,2011-11-01
...............\.....\bracketmatching.exe.intermediate.manifest,381,2011-11-01
...............\.....\bracketmatching.lastbuildstate,71,2011-11-01
...............\.....\bracketmatching.log,126,2011-11-01
...............\.....\bracketmatching.obj,13817,2011-11-01
...............\.....\BuildLog.htm,6754,2010-11-06
...............\.....\CL.read.1.tlog,1758,2011-11-01
...............\.....\CL.write.1.tlog,494,2011-11-01
...............\.....\link.read.1.tlog,2596,2011-11-01
...............\.....\link.write.1.tlog,822,2011-11-01
...............\.....\mt.dep,60,2010-11-06
...............\.....\mt.read.1.tlog,736,2011-11-01
...............\.....\mt.write.1.tlog,364,2011-11-01
...............\.....\vc100.idb,44032,2011-11-01
...............\.....\vc100.pdb,53248,2011-11-01
...............\Release
...............\.......\bracketmatching.Build.CppClean.log,1199,2011-10-31
...............\.......\bracketmatching.exe.intermediate.manifest,381,2011-10-31
...............\.......\bracketmatching.lastbuildstate,73,2011-10-31
...............\.......\bracketmatching.log,175,2011-10-31
...............\.......\bracketmatching.obj,15171,2011-10-31
...............\.......\CL.read.1.tlog,1758,2011-10-31
...............\.......\CL.write.1.tlog,502,2011-10-31
...............\.......\link.read.1.tlog,2746,2011-10-31
...............\.......\link.write.1.tlog,696,2011-10-31
...............\.......\mt.read.1.tlog,744,2011-10-31
...............\.......\mt.write.1.tlog,372,2011-10-31
...............\.......\vc100.pdb,53248,2011-10-31

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

  • 数据结构算法集锦
    数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法(algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.)
    2005-06-28 19:55:07下载
    积分：1
  • yuesehuhuan
    就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)
    2007-11-22 11:35:10下载
    积分：1
  • hanoi
    Hanoi塔问题非递归算法实现，几个具体的实现算法(Tower of Hanoi non-recursive algorithm, the realization of a number of specific algorithms)
    2009-07-13 08:45:51下载
    积分：1
  • binary-tree
    数据结构 二叉树的操作，可以对二叉树进行最基本的操作，先建立二叉树。(The operation of the binary tree, binary tree with the most basic operation, first create a binary tree.)
    2012-03-20 21:19:43下载
    积分：1
  • lesson1-2
    棋盘覆盖，算法分析，很有用的东西，大家一起来分享一下(Board covers, algorithm analysis, useful things, we share together)
    2011-01-06 15:15:11下载
    积分：1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分：1
  • maze
    迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分：1
  • bintree
    一个关于二叉树应用的小程序,包括二叉树的建立，前中后遍历等操作(a program about bintree structure)
    2009-05-17 16:54:29下载
    积分：1
  • 1013_digital_root
    数字根算法，用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和，再把这个和的各位数字相加又得一个和，再继续作数字和，直到最后的数字和是个位数为止，这最后的数称为最初那个数的“数字根”。(Digital root algorithm, with the most simple code to calculate the digital root. If you figure in a large numbers is the sum of a, then this and you figure the sum is again a, and then continue for digital and until the final figure and the single digits, the last number called initially that the number of "digital root".)
    2012-04-27 10:07:18下载
    积分：1
  • 约瑟夫环的循环链表实现
    约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)
    2005-07-03 19:38:38下载
    积分：1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载

热门标签

Visual C++ matlab C/C++ Java Others Unix_Linux EasyLanguage易语言 Visual Basic C# PDF C++ Delphi VHDL ASP WINDOWS
热门下载

Copyright© 2019-2026 | Powered by Imdn | 浙ICP备16007336号 | IMDN交流 | 联系客服（QQ：3324461878）

本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！