-
图论经典算法，包括最短路径，最小生成树，强联通分支等
图论经典算法，包括最短路径，最小生成树，强联通分支等-Classical graph theory algorithms, including shortest path, minimum spanning tree, strong branch of China Unicom, etc.
- 2022-03-10 13:09:16下载
- 积分：1
-
这是一个用C++语言编写的约瑟夫环问题,旁附说明,已在测试环境下成功通过...
这是一个用C++语言编写的约瑟夫环问题,旁附说明,已在测试环境下成功通过-This is a C language of Josephus, adjacent to report stated that the testing environment has been successfully adopted
- 2022-01-24 09:54:47下载
- 积分：1
-
shujuku
数据库654 521654321654132-shujuku
- 2022-06-02 16:32:26下载
- 积分：1
-
大型数据库系统开发指南,对大型数据库设计做了比较详细的讲解...
大型数据库系统开发指南,对大型数据库设计做了比较详细的讲解-Large-scale database systems development guidelines, for large database design has done a more detailed explanations
- 2023-02-07 03:35:10下载
- 积分：1
-
完成数据结构的最小生成树，程序很实用，不需要修改！
完成数据结构的最小生成树，程序很实用，不需要修改！-The completion of the minimum spanning tree data structure, the program is very useful, do not need to change!
- 2022-06-03 05:48:59下载
- 积分：1
-
Variable postfix infix expression evaluation: Enter the expression,# to end the...
中缀变后缀表达式求值：输入表达式，#为结束符(如1+2#），程序会自动给出后缀表达式，并给出最终计算结果。程序中部分地方有注释-Variable postfix infix expression evaluation: Enter the expression,# to end the character (eg, 1+2#), the program will automatically give postfix expression, and gives the end result. Some parts of the program annotated
- 2022-05-29 12:56:14下载
- 积分：1
-
ＰＯＪ １１２５己ＡＣ源代码，不信你可以试试．
ＰＯＪ １１２５己ＡＣ源代码，不信你可以试试．-POJ 1125 F AC source code, do not believe you can try.
- 2023-06-11 04:30:08下载
- 积分：1
-
If it is found that the control has prompted unregistered, please run
如果发现有提示控件未注册,请运行"控件注册.bat"注册控件.-If it is found that the control has prompted unregistered, please run
- 2022-08-25 02:53:06下载
- 积分：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
-
一个简单的公交查询管理系统，采用最短路算法，使用ODBC…
一个简单的公交查询管理系统，采用最短路算法，利用odbcapi函数访问数据库。-a simple inquiry transit management system, the most shorted algorithm, use odbcapi function access to the database.
- 2022-03-18 11:43:55下载
- 积分：1
