-
0 / 1背包问题的几种解决方案,包括回溯,动态规划…
0/1背包问题的几种解法,包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
- 2022-08-04 06:47:07下载
- 积分:1
-
这是一个有关于VC++6.0与数据库ACCESS相结合的小程序
这是一个有关于VC++6.0与数据库ACCESS相结合的小程序-This is a database on the VC++6.0 with a combination of small programs ACCESS
- 2022-04-11 17:08:43下载
- 积分:1
-
匈牙利算法实现二分图最大匹配
文件输入输出.
匈牙利算法实现二分图最大匹配
文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.
- 2022-07-19 23:47:19下载
- 积分:1
-
八皇后问题,回溯算法的经典例子,此程序可以扩展至n皇后问题。...
八皇后问题,回溯算法的经典例子,此程序可以扩展至n皇后问题。-eight Queen"s problems, backtracking algorithms classic example of this procedure can be extended to n Queen"s problem.
- 2022-11-28 00:55:03下载
- 积分:1
-
开括号和比括号的匹配,数据结构内容,很不错
开括号和比括号的匹配,数据结构内容,很不错-More than brackets and brackets to open the match, the contents of data structure
- 2023-08-24 01:50:03下载
- 积分:1
-
XMathLib是一个通用的3D图形数学库。
其中包含两个部分:
XMathLib和XGeomLib。分别处理数学和几何运算。
数学部分包含向量、矩...
XMathLib是一个通用的3D图形数学库。
其中包含两个部分:
XMathLib和XGeomLib。分别处理数学和几何运算。
数学部分包含向量、矩阵、四元数的运算。以及其它的运算。
几何部分包含Box Frustum AABB OBB Ray Line Line-Segment Plan Triangle等的运算。-XMathLib is a generic 3D graphics math. Which consists of two parts : XMathLib and XGeomLib. Separate processing mathematical and geometric computing. The math section includes vector, matrix, quaternion arithmetic. , And other arithmetic. Geometric part consists Box Frustum AABB OBB Ray Line Line-Segme nt Plan Triangle such arithmetic.
- 2023-04-15 11:00:03下载
- 积分: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
-
Decision Tree
这是ID3决策树算法的一个示例实现
- 2023-01-28 00:40:04下载
- 积分:1
-
用VC++6.0开发多表联接的数据库应用程序
用VC++6.0开发多表联接的数据库应用程序-VC 6.0 multi-table database connectivity application
- 2022-02-09 14:28:28下载
- 积分:1
-
算法类,二进制搜索的源代码,算法导论上的
算法类,二进制搜索的源代码,算法导论上的-Algorithm-type, binary search of the source code, algorithm Introduction to the
- 2022-11-29 04:00:03下载
- 积分:1