-
BinaryTree
二叉树实现，整个包为VS工程。包含了二叉树的基本功能(Binary Tree, the entire package is VS works. Contains the basic functions of the binary tree)
- 2012-12-28 10:40:23下载
- 积分：1
-
PRIM
PRIM算法 对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。(PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.)
- 2009-01-11 19:05:21下载
- 积分：1
-
bracketmatching
这个程序用来解决树结构与树之间的程序匹配的问题这个程序可以解决很多的问题(it is very good)
- 2013-01-21 21:48:17下载
- 积分：1
-
bfs
这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)
- 2013-12-05 15:56:50下载
- 积分：1
-
hamidunp2Boulatu
关于中国邮递员的解决办法，个人觉得还不错的说(Chinese postman)
- 2012-06-10 17:28:15下载
- 积分：1
-
C-integer-linear-sequence
对元素类型为整型的顺序存储的线性表进行插入、删除和查找操作(C++)。(C integer linear sequence of stored data table insert, delete and search operations)
- 2011-11-20 11:13:40下载
- 积分：1
-
44
说明： 给定程序中，函数fun的功能是：将a所指3×5矩阵中第k列的元素左移到第0列，第k列以后的每列元素依次左移，原来左边的各列依次绕道右边。
例如，有以下矩阵：
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
若k结果为2，程序执行结果为：
3 4 5 1 2
3 4 5 1 2
3 4 5 1 2
请在程序的下划线处填入正确的内容并把下划线删除，使程序得出正确的结果。
注意：源文件存放在考生文件夹下的BLANK1.C中
不得增行或删行，也不得更改程序的结构！
(A given program, function fun feature is: a 3 × 5 matrix referred to in the first k elements of the left column to move Section 0, the k elements of each column after column followed by the left, the original columns in the left turn Bypass on the right. For example, the following matrix: 123,451,234,512,345 If k is 2, the program execution results: 345,123,451,234,512 in the program underscore the right content at the fill and to remove the underscore, so that the program reach the right result. Note: The source files in the folder of BLANK1.C candidates are not allowed by the line or delete line, nor change the structure of the program!)
- 2011-08-11 07:53:10下载
- 积分：1
-
Tic-tac-toe-chess
C语言实现井字棋博弈的过程，采用极大极小算法。(The C language game of tic-tac-toe chess, using the minimax algorithm.)
- 2012-05-20 23:15:48下载
- 积分：1
-
migong
以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有
通路的结论
(To an m* n the long square maze, 0 and 1, respectively maze of paths and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or the conclusions drawn without passage)
- 2013-06-14 10:24:48下载
- 积分：1
-
josephus
通过c语言数组算法解决josephus问题，m个人围成一圈，从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开，最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory)
- 2017-11-12 10:30:06下载
- 积分：1
