-
字典树算法，可以很方便的实现多叉树，而且查找很方便，是ACM算法设计中常用的数据结构...
字典树算法，可以很方便的实现多叉树，而且查找很方便，是ACM算法设计中常用的数据结构-Dictionary tree algorithm, can be very convenient multi-tree, and find very convenient is the design of ACM algorithms commonly used data structure
- 2022-03-18 17:01:48下载
- 积分：1
-
libgist是广义的搜索树的一种实现，模板索引结构。
Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).
-Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).
- 2022-03-25 06:12:32下载
- 积分：1
-
discriminant obtained delimiters are made into the heart of military combat cost...
判别算得到 定界符 所进肺腑 军费发 费用打击法打击法 夫君诶非 夫君诶发-discriminant obtained delimiters are made into the heart of military combat costs combat goes wherever eh eh-fat
- 2022-12-06 20:35:03下载
- 积分：1
-
凸包算法的实现，用的控制台程序，不过已经能够说明问题了...
凸包算法的实现，用的控制台程序，不过已经能够说明问题了-convex hull algorithm for the realization of the console procedures, but has been able to illustrate the problem
- 2022-03-23 12:33:00下载
- 积分：1
-
求矩阵特征值、解方程组
求矩阵特征值、解方程组 -seeking matrix eigenvalue solution equations for matrix eigenvalue equations Solutions
- 2022-03-18 20:26:41下载
- 积分：1
-
poj1125 binary heap using the Dijkstra algorithm optimization
poj1125用二叉堆优化的Dijkstra算法-poj1125 binary heap using the Dijkstra algorithm optimization
- 2022-07-15 13:25:37下载
- 积分：1
-
C语言精典编程100例，适合初学者下载学习打基础。
C语言精典编程100例，适合初学者下载学习打基础。-C language 100 cases of classical programming, suitable for beginners to download learning foundation.
- 2022-04-07 13:50:03下载
- 积分：1
-
镜头26102 i_plasma。中断
Shot 26102 I_plasma. Disruption
- 2023-05-23 07:10:03下载
- 积分：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
-
解析中央气象局下发的台风报文，提取有用信息，入数据库
解析中央气象局下发的台风报文，提取有用信息，入数据库-Analysis of the Central Weather Bureau issued a typhoon message, extract useful information into the database
- 2022-08-05 17:07:52下载
- 积分：1
