-
本程序用于数据结构中关于图部分的广度优先搜索和深度优先搜索。...
本程序用于数据结构中关于图部分的广度优先搜索和深度优先搜索。-This procedure for the data structure on the map part of the breadth-first search and depth-first search.
- 2023-03-28 18:05:04下载
- 积分：1
-
its our assignment to build interface for a booking system at UMS spisk school
its our assignment to build interface for a booking system at UMS spisk school
- 2022-12-02 08:55:03下载
- 积分：1
-
ESQL/C Informix C ~ { 7cnjj >；76 ~ }
ESQL/C Informix C~{7CNJJ>76~}
- 2022-07-20 10:27:45下载
- 积分：1
-
一个Oracle性能监视工具，含几个sql文件
一个Oracle性能监视工具，含几个sql文件- A Oracle performance surveillance tool, contains several sql
document
- 2022-07-01 21:02:31下载
- 积分：1
-
有关B
有关B-树的删除添加修改操作-the B-tree to add amendments to delete operation
- 2022-03-05 00:00:09下载
- 积分：1
-
此程序为求两个数的约数,将他们输出,将这两个数的最大公约数输出...
此程序为求两个数的约数,将他们输出,将这两个数的最大公约数输出
-procedure for the sake of a few two about a few of their exports, the number of these two majors output
- 2022-01-22 08:30:59下载
- 积分：1
-
车辆管理
车辆管理-vehicle management
- 2022-02-22 09:17:58下载
- 积分：1
-
为保障煤矿为例
example for security of meikuang
- 2022-03-20 03:19:24下载
- 积分：1
-
哈夫曼树算法
根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj
在森林中选取两棵根结点权值最小的树作左右子树，构造...
哈夫曼树算法
根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj
在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和
在森林中删除这两棵树，同时将新得到的二叉树加入森林中
重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树
-Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree
- 2023-05-05 13:05:03下载
- 积分：1
-
思想很简单，就是一个循环链表
但要说明的是：我之所以用clist(1)来初始化，主要是我刚开始编的时候没打算解决约瑟夫环，只是想编一个带表头的循环链表...
思想很简单，就是一个循环链表
但要说明的是：我之所以用clist(1)来初始化，主要是我刚开始编的时候没打算解决约瑟夫环，只是想编一个带表头的循环链表，然后我用从这个程序改过来的，所以代码可以进一步优化。-Thinking is very simple, that is, a cycle list but would like to note is: I use clist (1) to initialize, mainly because I had just started when Joseph did not intend to resolve the ring, just want to provision a table with the head circulation list, and then I used to come from this process, so the code can be further optimized.
- 2022-09-15 15:25:03下载
- 积分：1
