登录
首页 » 数据结构 » ADO封状类。

ADO封状类。

于 2022-07-08 发布 文件大小:6.22 kB
0 65
下载积分: 2 下载次数: 1

代码说明:

使用ADO进行联接数据据的类封装。可以很便利地实现数据库的读写查。 

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 用于实现的基本算法的任务分配功能
    用数据结构实现基本算法 用C++实现任务分配功能-data structure used to achieve basic algorithm C Task allocation functions
    2022-03-04 14:24:09下载
    积分:1
  • 的课程设计,是实现二叉树的,包括文档。...
    数据结构的课程设计,是实现二叉树的数据结构,包括文档。-Data structures course design is to achieve binary tree data structure, including the documentation.
    2023-07-10 01:55:03下载
    积分:1
  • 1背包问题的动态规划求解算法, 0
    0-1背包问题的动态规划求解算法, 0-1背包不同于背包问题-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
    2022-09-02 03:40:02下载
    积分:1
  • 链表与组的交换 的实验基本内容 讲组中的存进链表...
    链表与数组的数据交换 数据结构的实验基本内容 讲数组中的数存进链表-chain with an array of data exchange data structure of the basic contents of the array of speakers for storing Chain
    2022-04-27 17:54:56下载
    积分:1
  • (1)输入E条弧<j,k>,建立AOE
    (1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time
    2022-03-20 01:39:05下载
    积分:1
  • Including the string reversal, list reversal, to determine the existence of two...
    包括字符串反转, 链表反转, 判断两个数组中是否存在相同的数字, 判断链表是否存在环, 找出单向链表的中间结点, 如何判断一棵二叉树是否是平衡二叉树, strstr()的简单实现,-Including the string reversal, list reversal, to determine the existence of two different array of figures to determine the existence of ring list, find the middle of a one-way linked list nodes, how to determine whether it is a balanced binary tree Binary Tree, strstr () to achieve a simple,
    2022-04-24 01:21:16下载
    积分:1
  • PHP的beginers
    亲爱的同学们是打印指令和数据库操作和不同的行动,在 php 编程
    2022-10-31 23:05:02下载
    积分:1
  • 库开发,用delphi实现库的开发 大家可以借鉴以下
    数据库开发,用delphi实现数据库的开发 大家可以借鉴以下-database development using delphi database development we can learn from the following
    2022-06-15 04:09:53下载
    积分:1
  • 仓库源码。自己制作的。希望大家可以来信息指教
    仓库源码。自己制作的。希望大家可以来信息指教-Warehouse source. Their own. I hope everyone can come to information index
    2022-11-04 07:35:03下载
    积分:1
  • A fart
    阿屁虎网站游戏算法,准确性大,保证赚钱,-A fart-hu site game algorithm, the accuracy of large, guaranteed to make money,
    2023-08-30 23:10:03下载
    积分:1
  • 696518资源总数
  • 104353会员总数
  • 66今日下载