-
VFP网络编程实例一则
VFP网络编程实例一则-VFP Network Programming Example 1
- 2022-04-19 07:05:01下载
- 积分：1
-
该程序在于如何进行图片存取,怎样访问EXCEL表格.
该程序在于如何进行图片存取,怎样访问EXCEL表格.-the program is how to access pictures, how to visit Excel.
- 2022-01-28 06:15:56下载
- 积分：1
-
刚刚用ACCESS做的
刚刚用ACCESS做的-just do ACCESS
- 2022-06-01 07:30:17下载
- 积分：1
-
使用贪心算法实现PRIM最小生成树算法.经典的算法题目.
使用贪心算法实现PRIM最小生成树算法.经典的算法题目.-PRIM algorithm using the greedy algorithm for minimum spanning tree. Classic topics algorithm.
- 2022-03-24 02:39:35下载
- 积分：1
-
数据结构中的几种基本结构的C++实现：栈、队列、链表
数据结构中的几种基本结构的C++实现：栈、队列、链表-data structure of several basic structure of the C achieved : Stack, Queue, Listless
- 2022-07-17 23:45:46下载
- 积分：1
-
一个适用于书店的图书管理信息系统，包括各种统计分析、员工管理等...
一个适用于书店的图书管理信息系统，包括各种统计分析、员工管理等-a bookstore in the library management information systems, including statistical analysis, staff management etc.
- 2022-03-20 04:53:34下载
- 积分：1
-
回溯法 解决男女匹配问题 八男八女匹配
回溯法 解决男女匹配问题 八男八女匹配-Backtracking address gender matching eight men and eight women match
- 2023-02-19 02:00:03下载
- 积分：1
-
四种算法求最短路径的例子，C#，图形演示
分别为贪心发，动态规划发，分支限界法，和回溯法...
四种算法求最短路径的例子，C#，图形演示
分别为贪心发，动态规划发，分支限界法，和回溯法-Four shortest path algorithm for example, C#, Graphical presentations were greedy fat, fat, dynamic programming, branch and bound method, and backtracking
- 2023-08-31 01:50:03下载
- 积分：1
-
数据结构常用算法设计 用C++实现二叉排序树与平衡二叉树
数据结构常用算法设计 用C++实现二叉排序树与平衡二叉树-algorithm commonly used data structures designed to achieve two C-tree fork and balanced binary tree
- 2023-05-30 18:00: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
