-
Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the...
迷宫问题。以一个 m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论
起点就是方阵中的（1，1）终点就是（m-1，n-1） -Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the maze of paths and obstacles. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no access point is a square matrix of the (1,1) The end is (m-1, n-1)
- 2022-04-15 13:14:53下载
- 积分：1
-
算法书籍
算法书籍---一本很好的算法书，希望大家喜欢-Algorithm
- 2023-03-31 21:15:04下载
- 积分：1
-
哈夫曼树
在 C + + 包括节点和整个数据结构和 haffcode 执行完整的哈夫曼树
- 2022-02-28 09:21:02下载
- 积分：1
-
数据库 编程VC++ ADO.net
VS 2013 编译。用的是ADO.的技术 访问SQL2008的数据库。是做课程设计的一部分。重新包装了类，更易使用
- 2022-12-29 17:15:18下载
- 积分：1
-
建立家谱文件，可以添加新成员，输出指定家庭的所有成员，确定指定成员在家族中的辈份（第几代），输出指定辈的所有成员...
建立家谱文件，可以添加新成员，输出指定家庭的所有成员，确定指定成员在家族中的辈份（第几代），输出指定辈的所有成员-The establishment of genealogy files, you can add new members, the output of all the designated family members, to determine the designated members of the seniority in the family (the first few generations), the output of all the members of the designated generation
- 2023-08-02 12:00:03下载
- 积分：1
-
Computes estimates for the number of fores ts of a graph. input as a 0
Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.
- 2022-02-05 15:36:49下载
- 积分：1
-
Oracle Service Manager
Oracle Service Manager
- 2022-03-11 10:03:04下载
- 积分：1
-
哈夫曼树的建立,haffman 编码,在turbo c 下运行
哈夫曼树的建立,haffman 编码,在turbo c 下运行-Huffman Tree, haffman encoding, turbo c in the run
- 2022-04-26 16:02:39下载
- 积分：1
-
在学习数据结构时，往往不知道那些结构与算法有何用，以及怎么用。这个小小程序充分显示了Huffman二叉树的应用。虽然其压缩效果比RAR相差甚远，但也能说明一二。...
在学习数据结构时，往往不知道那些结构与算法有何用，以及怎么用。这个小小程序充分显示了Huffman二叉树的应用。虽然其压缩效果比RAR相差甚远，但也能说明一二。
-the study data structure, they often do not know what the structure and algorithm, as well as how use. This little procedure fully demonstrated the application of the binary tree Huffman. Although the compression ratio falls far short of RAR, but can also explain on January 2.
- 2022-03-20 23:18:20下载
- 积分：1
-
有许多是考研要用的！三路归并算法，快速排序的非递归算法，无向连通图的非递归的深度优先遍历等，，希望大家用得着...
有许多是考研要用的！三路归并算法，快速排序的非递归算法，无向连通图的非递归的深度优先遍历等，，希望大家用得着-many are taking tests to use! Three road merging algorithm, rapid sequencing of non- recursive algorithm, undirected graph of the non- recursive depth-first traversal, and we hope that it needs! !
- 2022-02-02 02:47:36下载
- 积分：1
