-
VC环境下实现动态添加删除用户,数据库为SQL Sever 2
VC环境下实现动态添加删除用户,数据库为SQL Sever 2-VC environment dynamically add the user to delete the database for the SQL Sever 2000
- 2023-05-18 00:45:02下载
- 积分:1
-
binary search algorithm, to achieve a set of data for the search operation, the...
折半查找算法,实现对于一组数据的查找操作,利用折半查找法进行查找-binary search algorithm, to achieve a set of data for the search operation, the use of binary search method you
- 2023-02-02 17:15:04下载
- 积分:1
-
用循环链表解决约瑟夫环问题。对学习循环链表有很大帮助
用循环链表解决约瑟夫环问题。对学习循环链表有很大帮助-By cyclic list Joseph Central problem to solve. Learning cycle has a great list to help
- 2022-06-20 16:38:30下载
- 积分:1
-
SQL连接Java
应用背景此代码可用于制作与使用Java SQL数据库连接!你只需要替换数据库中的地址信息,用户名和通。关键技术此代码可用于建立数据库连接使用Java和SQL服务器中的应用。它不仅显示了如何连接到数据库,而且还可以如何进行查询和管理数据库连接。
- 2022-07-07 18:08:01下载
- 积分:1
-
最小生成树问题
若要在n个城市之间建设通信网络,只需要架设n...
最小生成树问题
若要在n个城市之间建设通信网络,只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网,是一个网的最小生成树问题。
(1)利用克鲁斯卡尔算法求网的最小生成树。
(2)实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。
(3)以文本形式输出生成树中各条边以及他们的权值。
-minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.
- 2023-06-26 07:25:03下载
- 积分:1
-
有陡峭的数据结构、Flash的PPT,帮助你快速了解铝…
有很陡数据结构的flash,PPT,帮你快速理解算法,一步步执行理解方便-There are steep data structure, flash PPT, to help you quickly understand the algorithm, a step by step to facilitate the implementation of the understanding
- 2022-08-10 22:31:41下载
- 积分:1
-
Included in the sequence of recursive binary tree traversal and non
包含中序遍历二叉树的递归和非递归算法的源代码-Included in the sequence of recursive binary tree traversal and non-recursive algorithm source code
- 2023-05-06 04:15:03下载
- 积分:1
-
首先确认您的机器上已经安装了VC6.0以上版本,要编译生成可执行文件,需打开后缀名为dsw的文件,系统会默认用VC打开,然后选择Build菜单下的Set Act...
首先确认您的机器上已经安装了VC6.0以上版本,要编译生成可执行文件,需打开后缀名为dsw的文件,系统会默认用VC打开,然后选择Build菜单下的Set Active Configuration选项,选择Project Configuration为Win32 Release,然后编译项目,得到可执行文件。连接数据库请参照第2章的方法,在ODBC数据源内添加Microsoft Access数据库-First of all, make sure that your machine has been installed above VC6.0 to compile the executable file to generate the need to open the dsw file name suffix, the system will default to open with VC, and then select the Build menu, Set Active Configuration under the option, Project Configuration options for the Win32 Release, and then compile the project, the executable file. Connect to database please refer to the methods of Chapter 2, in the ODBC data source in Microsoft Access database to add
- 2022-06-20 13:33:37下载
- 积分:1
-
c调用sqlite的完整的程序,对学习sqlite很有帮助
c调用sqlite的完整的程序,对学习sqlite很有帮助-c call sqlite complete the procedure, very helpful in learning sqlite
- 2022-04-16 20:14:15下载
- 积分:1
-
堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子
算法平...
堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子
算法平均时间复杂度: O(nlogn)
-HEAPSORT: thinking: using binary tree structure to express the array, and used to express an array of binary tree structure, such as i the parent node for its children, 2i, and 2i+ 1. Among them, the big top of a pile of the parent node greater than two children on average time complexity of algorithm: O (nlogn)
- 2022-07-11 06:36:53下载
- 积分:1