-
With the prim algorithm is seeking to use adjacency matrix storage structure, s...
用普里姆（Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树-With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree
- 2022-02-09 15:56:42下载
- 积分：1
-
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
-
冒泡排序算法，最基础的Bubble sort 算法，经典
冒泡排序算法，最基础的Bubble sort 算法，经典-bubble sort
- 2022-11-05 04:15:03下载
- 积分：1
-
1.通过鼠标拖拽和弹出对话框完成实体、属性、联系的绘制以及各参数设定
2.对绘制的实体、属性、联系提供合法性检查
3.对绘制的图形进行拖动、重设大小、删...
1.通过鼠标拖拽和弹出对话框完成实体、属性、联系的绘制以及各参数设定
2.对绘制的实体、属性、联系提供合法性检查
3.对绘制的图形进行拖动、重设大小、删除
4.通过属性对话框对实体、属性、联系的各种参数进行重新设置
5.数据的串行化
6.将绘制完成的E-R图转换成数据库脚本-1. Through mouse drag and drop and pop-up dialog box to complete entities, attributes, links, as well as drawing parameter setting 2. Drawing entities, attributes, links provided to check the legality of 3. The graphics on the drawing drag, reset size, delete 4. through the Properties dialog box on the entities, attributes, linked to various parameters re-set 5. serialization of data 6. will be drawn to complete the ER diagram into a database script
- 2022-01-25 17:40:07下载
- 积分：1
-
基于对话框的数据库编程
基于对话框的数据库编程-Database Programming
- 2022-09-01 04:50:02下载
- 积分：1
-
与清华大学版的《数据结构》匹配二叉树的实现：BITREE1.CPP：为主程序，其中实现了递归算法以及非递归算法的前序遍历，中序遍历，后序遍历。TSTACK1.H...
与清华大学版的《数据结构》匹配二叉树的实现：BITREE1.CPP：为主程序，其中实现了递归算法以及非递归算法的前序遍历，中序遍历，后序遍历。TSTACK1.H: 为头文件，其中定义了一些常量的值，其中也包括了书中第三章的栈的实现，只需要将注解符去掉即可。运行环境为：VC++6 或 TC3-and Tsinghua University version of the "data structure" matching the achievement of a binary tree : BITREE1.CPP : mainly procedures, which achieved a recursive and non- recursive algorithm of algorithms preorder, preorder, after preorder. TSTACK1.H : for the first document, which defines a number of the value of a constant, which also include a third chapter of the book stack the realization simply have the website notes can be removed. Operating environment : VC 6 or TC3
- 2023-08-23 23:30:03下载
- 积分：1
-
PB中的PFC使用例程，包含精简PFC类库
PB中的PFC使用例程，包含精简PFC类库-PB PFC use routines, including streamlining the PFC
- 2023-04-22 16:30:03下载
- 积分：1
-
eXtremeDB与# 39；的示例代码，对你有用！！
extremeDB s sample code,useful for you-extremeDB"s sample code, useful for you! !
- 2022-11-07 18:50:04下载
- 积分：1
-
should I do our school among a software, it is our resolve to schools such condi...
是我应我们学校学工部做的软件,其主要是解决想我们学校这样的条件--各个办公室之间还没有建立联网,而且学校分为两个校区（又不在一个城市).
因此，学工部每年的学分登记工作都很麻烦．每学年初，学工部要把当年发布的学分评测规定发到各系，学年末又要把从系里面提交的学分表收齐,然后手工登记,非常的麻烦.有时是系里面的学分报表太乱，有些资料丢失，要么是，系里面把各年的学分评测规定弄混，经常搞的他们一头雾水，于是为他们就请我做这个系统.
这个系统的工作流程是，每个学年初，学工部输入当年的学分评定规定，然后到处成为学分评测数据，然后Copy给各个系，各个系在每个学年中，输入新的专业，年级，班级和新生的资料，然后登记学分评测的纪录和考试的成绩．当学年末到了，各系把党学年的数据导成数据库，然后copy给学工部，学工部就可以用电脑纪录所有的学分纪录．
-should I do our school among a software, it is our resolve to schools such conditions-- every office has not yet been established between the network and the school is divided into two campuses (not in a city). Therefore, each of the credit among a registration work very troublesome. Every beginning of the school year, among a year should release the credit evaluation of the provisions of the various faculties, should also learn from the end line inside the table collected credits, and then manual registration, very troublesome. Sometimes there is too much of the credit chaos statements, some of the inform
- 2022-03-23 09:43:26下载
- 积分：1
-
一个操作ＤＢＦ格式文件的类
一个操作ＤＢＦ格式文件的类-an operation of the DBF format category
- 2022-03-17 13:48:08下载
- 积分：1
