登录
首页 » 数据结构 » 基于 vb 的图书馆管理

基于 vb 的图书馆管理

于 2022-02-27 发布 文件大小:1.62 MB
0 213
下载积分: 2 下载次数: 1

代码说明:

越来越多的书会导致非托管库。这里是一个简单的桌面项目,可以帮助任何研究所管理其图书馆。

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

发表评论

0 个回复

  • Establishment and tree traversal can be achieved: (1) tree created using the fir...
    二叉树的建立与遍历 可实现: (1)树的创建采用先序方式,用特殊符号0表示左、右子树为空 (2)每次输入一个节点的值,可以根据自己的需要设计不同的节点结构 (3)节点的值为非零数 (4)可以()形式输出创建的树 (5)用先序后序和中序遍历树 (6)销毁树 -Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees
    2022-05-14 12:51:14下载
    积分:1
  • Tab4.rarC语言的实习作业:管理系统
    Tab4.rarC语言的实习作业:管理系统-Tab4.rarC language training operations : Management System
    2022-08-25 01:43:41下载
    积分:1
  • 2013年北邮预录取上机考试题解答
    本次上机考试包括4题,求P点,求日期,求最大值与最小值,和求最小距离。 难度以最P点与求最小距离较难。题目在文件中已包含,写有详细的注释。
    2022-08-11 05:44:53下载
    积分:1
  • /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
    迷宫算法(maze) /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.
    2022-08-08 06:28:42下载
    积分:1
  • poj3233 the subject and the subject of problem
    poj3233的题目及解题代码 poj3233的题目及解题代码-poj3233 the subject and the subject of problem-solving and problem-solving poj3233 code code code poj3233 the subject and problem-solving
    2023-02-19 20:30:03下载
    积分:1
  • Title data structure operations, the stack and force the use of (capital letters...
    数据结构作业题,堆栈和队的使用(大写字母表示魔王语言的词汇;小写字母表示人的词汇语言;魔王语言中包含括号)-Title data structure operations, the stack and force the use of (capital letters that devil language vocabulary lowercase letters that people s vocabulary language devil language contained in brackets)
    2022-07-04 13:15:59下载
    积分:1
  • 清华大学讲义
    清华大学数据结构讲义-data structure lectures Tsinghua University
    2023-02-27 13:15:03下载
    积分:1
  • This is my personal vc done in the context of the realization of the maze. You c...
    这是我个人做的在vc环境下的迷宫问题的实现。各位可以参考或指教!-This is my personal vc done in the context of the realization of the maze. You can reference or enlighten!
    2023-02-28 21:45:03下载
    积分:1
  • 生产管理系统
    生产管理系统所有代码,
    2022-07-05 06:34:48下载
    积分:1
  • 社稷
    sheji
    2022-03-18 07:27:55下载
    积分:1
  • 696516资源总数
  • 106633会员总数
  • 4今日下载