-
这是一个用来查询历史数据的小程序，它曲线、柱状图来显示的...
这是一个用来查询历史数据的小程序，它曲线、柱状图来显示的-This is a historical data used to query a small program that curve, histogram to show the
- 2023-01-31 23:10:05下载
- 积分：1
-
描述：这个实验中需要实现的是拍卖系统的3个核心的类（Class Date, class Advertisement, and class Client）
目...
描述：这个实验中需要实现的是拍卖系统的3个核心的类（Class Date, class Advertisement, and class Client）
目的：
1，使用C++的数据类型；
2，实现所有声明的函数；
3，使用预处理器实现包含。-Description：This assessment requires the creation of three of the core classes of the auction project. Class Date, class Advertisement, and class Client are three of the fundamental classes in the system.
Outcomes: Students successfully completing this assignment would master the following outcomes.
Use fundamental C++ data types
Produce C++ class implementations given class declarations
Use the preprocessor to perform file inclusion
- 2022-02-01 12:00:05下载
- 积分：1
-
a small embedded database support SQL commands, the use of very simple
一个小型的嵌入式数据库，支持SQL命令，使用非常简单-a small embedded database support SQL commands, the use of very simple
- 2023-05-21 09:00:04下载
- 积分：1
-
定时器for timer for ic chip
定时器for timer for ic chip-timer for ic chip，timer for ic chip，timer for ic chip
- 2022-01-25 22:32:09下载
- 积分：1
-
数据结构中的各种排序,只要输入一定的数据就可以实现排序,显示结果...
数据结构中的各种排序,只要输入一定的数据就可以实现排序,显示结果-Data structure in a variety of sort, as long as the importation of a certain sort of data can be achieved, the result will be displayed
- 2022-06-12 05:38:45下载
- 积分：1
-
Prim algorithm using minimum spanning tree of the experimental procedures used i...
用prim算法实验最小生成树
本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树
定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。
定义二维数组g[ ][ ]来建立无向图的邻接矩阵。
-Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.
- 2022-03-16 20:21:07下载
- 积分：1
-
used to write the right matrix inversion algorithm, the introduction of direct i...
用c写的对矩阵求逆的算法，采用直接迭代，适合2阶和3阶矩阵-used to write the right matrix inversion algorithm, the introduction of direct iteration, for two bands and three bands Matrix
- 2022-02-05 09:38:44下载
- 积分：1
-
K平均聚类法，比较好用，又需要的赶紧下吧
K平均聚类法，比较好用，又需要的赶紧下吧-K-clustering method to compare easy to use, but also hastened to the needs of the next bar
- 2023-01-01 13:55:03下载
- 积分：1
-
KMP算法
解决了BruteForce算法效率低下的问题，并且在该基础上完成了子串重复时的性能优化
- 2023-05-15 20:00:02下载
- 积分：1
-
包含图的遍历和线性链表两个内容，压缩文件里含有设计报告...
包含图的遍历和线性链表两个内容，压缩文件里含有设计报告-Contains the graph traversal and linear chain of two elements, compressed file contains the design report
- 2022-03-05 16:09:50下载
- 积分：1
