登录
首页 » Visual C++ » migong---cPP

migong---cPP

于 2011-11-03 发布 文件大小:8KB
0 227
下载积分: 1 下载次数: 3

代码说明:

  迷宫问题C++代码。。。解决迷宫问题。。。。(Maze C++ code. . . Solve maze problems. . . .)

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

发表评论

0 个回复

  • CEIA
    POJ141的源代码,以空间换时间,速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)
    2011-10-25 18:13:24下载
    积分:1
  • xiao-yuan-dao-you
    说明:  设计济南大学校园平面图,所含的景点不少于10个。以图中顶点表示校内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等相关信息。 为来访客人提供图中任意景点相关信息的查询。 为来访客人提供图中任意景点的问路查询,即查询任意两个景点之间的一条最短的简单路径。 选作内容: 求校园的关节点。 提供图中任意景点查询,即求任意两点间的所有路径。 校园导游图的景点和道路的修改扩充功能。 扩充道路信息,如道路类别,沿途景色等级,一直可按客人所需分别查询人行路径或车行路径或观景路径。(Design jinan university campus plan, contains at least 10 spots in each vertex said in scenic spots, deposit attractions at the information such as the code name introduction On the path, deposit path length said related information )
    2011-03-21 19:54:06下载
    积分: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
  • StackandQueue
    该ppt包含了栈和队列的数据结构及基本操作,同时还有栈的举例(This ppt contains the stack and queue data structure and basic operation, as well as examples of the stack)
    2013-12-06 21:02:24下载
    积分:1
  • tanxinfangfa
    说明:  贪心方法是一种改进了的分级处理方法。它首先根据题意,选取一种量度标准。然后按这种量度标准对这n个输入排序,并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解,则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
    2006-05-15 21:50:01下载
    积分:1
  • StringClass
    这个代码是STRING类的声明及实现,因为我认为C++类库中的string类比较庞大,找一个函数需要很长时间,所以用一个简单明了的代替之.(STRING kind of statement and realized, because I think the C library string of relatively large, a function for a very long time. Therefore, the use of a simple and straightforward replaced it.)
    2006-05-17 17:46:58下载
    积分:1
  • 005
    c++ data struct stack
    2012-03-01 14:24:42下载
    积分:1
  • BDX
    设计、编写和调试面向对象C++程序,实现任意两个同类数据比大小 的通用函数(模板),涵盖普通数值型数据之间的比较、两个字符串之间的比较 (按字典序)、两个复数之间的比较(按模大小)等,并通过主函数加以调用和 测试。(Design, writing and debugging of object-oriented C++ procedures to achieve similar data than the size of any two generic functions (template), covering general comparison between numerical data, the comparison between the two strings (lexicographically), two Comparison between complex numbers (modulo the size), and through the main function to be invoked and tested.)
    2020-11-28 13:49:29下载
    积分:1
  • mofanwenti
    魔方问题 数据结构 使用c++ 经典问题(Cube problem Data Structure Using c++ Classic problem)
    2014-01-08 22:30:48下载
    积分:1
  • beipaowenti
    背包算法的c++简单实现,很有用的,可以看看(Knapsack algorithm)
    2012-04-10 19:32:41下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载