网站首页

登录

NoGo

于 2021-04-04 发布文件大小:924KB

 0  323

下载积分: 1 下载次数: 21

我要下载

代码说明：

计算机博弈大赛不围棋的代码个人所写，可以用来参考( U8BA1 u7B97 u673A u535A u5F08 u5927 u8D5B u4E0D u56F4 u68CB u7684 u4EE3 u7801 u4E2A u4EBA u6240 u5199 uFF0C u53EF u4EE5 u7528 u6765 u53C2 u8003)

文件列表：

不围棋
......\chess.cpp,4926,2015-05-24
......\chess.h,620,2015-05-24
......\Debug
......\.....\chess.obj,265236,2015-05-24
......\.....\main.obj,11373,2015-04-19
......\.....\vc60.idb,91136,2015-05-24
......\.....\vc60.pdb,110592,2015-05-24
......\.....\不围棋.exe,553003,2015-05-24
......\.....\不围棋.ilk,792800,2015-05-24
......\.....\不围棋.pch,2009772,2015-05-24
......\.....\不围棋.pdb,1393664,2015-05-24
......\main.cpp,84,2015-04-12
......\不围棋.dsp,4398,2015-04-13
......\不围棋.dsw,520,2015-04-12
......\不围棋.ncb,50176,2015-07-09
......\不围棋.opt,53760,2015-07-09
......\不围棋.plg,914,2015-05-24

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

发表评论

0 个回复

abc
数据结构的稀疏矩阵的几部分操作，广工的课程设计(Sparse matrix operations)

2013-12-03 15:57:53下载

积分：1
mapsearch
数据结构，关键路径问题，设计并实现关键路径的一种应用，采用图的算法(Data structure, critical path problem, using graph algorithm)

2016-01-09 17:34:45下载

积分：1
Graph
数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)

2013-11-28 10:53:29下载

积分：1
lesson1-2
棋盘覆盖，算法分析，很有用的东西，大家一起来分享一下(Board covers, algorithm analysis, useful things, we share together)

2011-01-06 15:15:11下载

积分：1
Subset
说明：子集和数问题.rar，用C++写的，可以运行(Subset of several problems. Rar, written in C++, you can run)

2010-04-16 17:42:12下载

积分：1
Graph
采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)

2007-12-25 16:55:03下载

积分：1
Graph
数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)

2013-11-28 10:53:29下载

积分：1
heapsort
说明：从最后一个非叶子结点开始从后往前进行调整，保证了根下的所有子树都是最大堆，最后对根进行调整，使整棵二叉树为最大堆，保证了根结点为整棵数的最大值点，完成了建堆的过程，再将根结点跟最后一个结点进行交换，如此反复操作，则堆排序就完成了，其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)

2008-11-11 22:53:42下载

积分：1
Insert
POJ 字符串的插入可以将一定长度的字符串插入之前给出的字符串之中(POJ string can be inserted into a length of string into a string before being given)

2013-11-21 23:27:17下载

积分：1
code1
键盘任意输入一组字母或数字生成无序数组，对数组按ASCII顺序进行排序（排序要求至少用两种排序算法），再从键盘输入一个值进行二分查找，返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)

2010-07-14 11:42:56下载

积分：1

696516资源总数
106914会员总数
0今日下载