登录
首页 » 数据结构 » 本系统采用Visual Foxprow 5.0编写,面向对象可视化编程,使系统的开发工作适应目前的流行趋势。设计时采用了常用的自顶向下的瀑布式结构化设计方法。各...

本系统采用Visual Foxprow 5.0编写,面向对象可视化编程,使系统的开发工作适应目前的流行趋势。设计时采用了常用的自顶向下的瀑布式结构化设计方法。各...

于 2022-03-22 发布 文件大小:77.57 kB
0 157
下载积分: 2 下载次数: 1

代码说明:

本系统采用Visual Foxprow 5.0编写,面向对象可视化编程,使系统的开发工作适应目前的流行趋势。设计时采用了常用的自顶向下的瀑布式结构化设计方法。各子系统具有独立的数据库结构,设计时力求简单易用,便于维护。各模块为平行关系,彼此间无直接的参数联系,也无库的交叉关联,从而保证各子系统可以单独运行。-the system using Visual Foxprow 5.0 preparation, visual, object-oriented programming, allowing the system to adapt to the current development trend in fashion. Used in the design of the popular top-down waterfall structure design method. The subsystem is independent of the database structure, design sought to be simple to use, easy to maintain. Each module for parallel relationship between the parameters are not directly linked, nor for the cross-linked, so that the subsystems can be run separately.

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

发表评论

0 个回复

  • 好用啊 ,主要是一些,小列子。你一定要看懂了再用!
    好用啊 ,主要是一些,小列子。你一定要看懂了再用!-handy ah, mainly some small Liezi. You must understand the reuse!
    2022-11-02 06:40:03下载
    积分:1
  • Binary tree of various operations, including the establishment of binary tree, t...
    二叉树的各种操作,包括二叉树的建立,前序、中序、后序遍历二叉树,另外还包含一个霍夫曼编码的实现。-Binary tree of various operations, including the establishment of binary tree, the former sequence, in order, after the tree traversal, and also includes the implementation of a Huffman code.
    2022-03-04 10:15:52下载
    积分:1
  • 利用克鲁斯卡尔算法求边集组GE所示图的最小生成树
    利用克鲁斯卡尔算法求边集数组GE所示图的最小生成树-Order to Kruskal algorithm using an array of GE edge set of minimum spanning tree as shown in Figure
    2022-01-22 09:15:23下载
    积分: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
  • 在有向图中计算最小生成树
    在有向图中计算最小生成树---Edmonds s Algorithm-Directed graph in calculating minimum spanning tree--- Edmonds s Algorithm
    2023-04-22 21:00:03下载
    积分:1
  • 用Delphi开发的经典的库系统
    用Delphi开发的经典的数据库系统-with the classic Delphi database system
    2022-04-24 06:39:47下载
    积分:1
  • 这次毕业设计的内容,计算机库所需的翻译…
    计算机数据库方面的有关内容,对需要毕业设计的外文翻译的同学有用-Computer database of the contents of the graduation project required the translation of foreign language students useful
    2022-02-26 23:31:38下载
    积分:1
  • 哈夫曼树的建立,haffman 编码,在turbo c 下运行
    哈夫曼树的建立,haffman 编码,在turbo c 下运行-Huffman Tree, haffman encoding, turbo c in the run
    2022-04-26 16:02:39下载
    积分:1
  • JavaCJavaCJavaCJavaCJavaCJavaC JavaC
    JavaCJavaCJavaCJavaCJavaCJavaC JavaC-JavaC
    2022-02-22 02:13:50下载
    积分:1
  • 使用递归的方法实现的算式分析器,给定一个符合C语言格式的算式,可以使用括号,单目运算符等,计算算式的运算果。...
    使用递归的方法实现的算式分析器,给定一个符合C语言格式的算式,可以使用括号,单目运算符等,计算算式的运算结果。-use recursive method formula Analyzer, to set a C-language format with the formula, you can use brackets, Monocular Operators, calculation formula of the calculation results.
    2022-02-05 05:34:16下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载