登录
首页 » Visual C++ » bracketmatching

bracketmatching

于 2013-01-21 发布 文件大小:31KB
0 117
下载积分: 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 个回复

  • exp2-1
    数据结构(第四版)第二章上机实验题源程序答案详解(Data structure (fourth edition) chapter on lab answer questions Detailed source)
    2014-12-31 09:14:51下载
    积分:1
  • stringmatch
    说明:  高速多字符串匹配程序,基于多字符串的KMP算法开发,能够实现多字符串的匹配(High-speed multi-string matching procedure, based on multi-string KMP algorithm development, to achieve multi-string match)
    2009-07-22 10:36:52下载
    积分:1
  • migong
    输入迷宫行列数,1代表墙0代表路,之后系统生成路径(Enter the maze ranks number 1 represents 0 for Wall Road, after the system-generated path)
    2016-05-14 20:16:00下载
    积分:1
  • xianxingbiaolianjie
    线性表的链接实现可利用单链表来实现,每个节点存储一个元素。 利用单链表来实现线性表的元素的插入,删除,修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)
    2011-04-26 11:57:25下载
    积分:1
  • 2
    说明:  用数据结构的遍历,对于小毛驴过河解决实际问题。(Traversing the data structure used for the small donkey across the river to solve practical problems.)
    2010-06-02 22:50:30下载
    积分:1
  • sgu-499
    题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 (Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)
    2011-08-30 21:56:59下载
    积分:1
  • astar
    A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
    2013-04-04 11:06:42下载
    积分:1
  • BeiDa_ACM1702
    北大ACM1702题 转换为3进制 很经典(NULL)
    2009-12-08 11:31:40下载
    积分:1
  • ds3
    单向链表的创建与操作 设单向链表中节点的数据域的数据类型为整型,编写函数实现以下操作: (1)实现单向链表的创建(包括初始化)与输出操作,节点的个数及节点的数据由用户输入。 (源代码:ds3-1.c) (2)查找给定的单链表中的第i个节点,并将其地址返回。若不存在第i个节点,则返回空地址。 (源代码:ds3-2.c) (3)查找给定的单链表中值为n的节点,并将其地址返回。若不存在值为n的节点,则返回空地址。同时,还应通过参数传回该节点的序号。 (源代码:ds3-3.c) (4)删除给定的单链表中的第i个节点,成功返回1,失败返回0。 (源代码:ds3-4.c) (5)删除给定的单链表中值为n的节点,成功返回1,失败返回0。 (源代码:ds3-5.c) (6)在给定的单链表的第i位上插入值为n的节点。 (源代码:ds3-6.c) (7)在给定单链表的值为m的节点的前面插入一个值为n的节点。 (源代码:ds3-7.c) (Creation and operation of a one-way linked list Set up a one-way linked list data type node integer data fields , write a function to achieve the following: ( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user . ( Source : ds3-1.c) ( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address. ( Source : ds3-2.c) ( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node . ( Source : ds3-3.c) ( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 . ( Source : ds3-4.c) ( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 . ( Source : ds3-5.c) ( 6 ) )
    2014-05-11 19:19:41下载
    积分:1
  • 257
    几个比较好的初级算法,初学者可以看一下思想,对算法入门(A few good elementary algorithms, beginners can look at thinking on algorithms entry)
    2013-06-16 14:38:40下载
    积分:1
  • 696518资源总数
  • 104223会员总数
  • 35今日下载