登录
首页 » Visual C++ » BSM

BSM

于 2008-05-04 发布 文件大小:46KB
0 178
下载积分: 1 下载次数: 2

代码说明:

  一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)

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

发表评论


0 个回复

  • length
    利用佛洛伊德算法计算节点之间的最短路径,用于复杂网络中计算平均路径长度(average path lengh)
    2011-09-01 11:13:51下载
    积分:1
  • Four-bracket-operator
    数据结构中,运用链表实现四则括号运算等,运行在VC控制台上。(Data structure, the use of chain operations to achieve four brackets, etc., running in the VC console.)
    2011-12-12 10:51:31下载
    积分:1
  • sort
    自己编写的几种经典的排序算法,里面有自己做的PPT详细讲解,希望有帮助吧(I have written several classic sorting algorithm, which own PPT explain in detail, I hope to help!)
    2012-08-28 09:31:28下载
    积分:1
  • Devillanguage1
    Devil language 数据结构中的经典问题 此为问题!(Devil language data structure of the classic problems of this problem!)
    2006-10-17 23:42:17下载
    积分:1
  • nuaa1507_DancingLink_trackback.cpp
    高德纳发明的高效数据结构dancing link,这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)
    2010-03-07 10:54:32下载
    积分:1
  • BFS
    迷宫问题 队列求解 界面还不完善 可以自己添加(Maze problem solving interface queue is not perfect you can add your own)
    2013-12-26 22:08:58下载
    积分:1
  • joseph
    用链表解决约瑟夫问题。 约瑟夫环是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。 其中包括一个实验报告,介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)
    2012-08-27 22:37:52下载
    积分:1
  • stack
    数据结构 堆栈 实现了以下功能: cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)
    2013-11-01 11:05:10下载
    积分:1
  • hash
    使用全排列实现hash,看看吧相信对大家会有些帮助的(Full array hash)
    2011-08-19 21:25:34下载
    积分:1
  • jhgrerfgjz
    一个简单的求矩阵求逆的c语言算法 一个简单的求矩阵求逆的c语言算法 一个简单的求矩阵求逆的c语言算法(a simple matrix inversion for the C language algorithms for a simple matrix inversion of the c language a simple algorithm The matrix inversion for the C language algorithms for a simple matrix inversion algorithm in C Language)
    2021-03-29 11:39:11下载
    积分:1
  • 696518资源总数
  • 104971会员总数
  • 8今日下载