-
ArkoMaster端系统模块设计文档
系统管理软件自主开发软件。
系统管理软件A实现最终目标：是可以自由横跨桌面（Desktop）、Client/S...
ArkoMaster端系统模块设计文档
系统管理软件自主开发软件。
系统管理软件A实现最终目标：是可以自由横跨桌面（Desktop）、Client/Server、大型主机的不同层次的管理，管理的对象包括应用程序（Applications），数据库(Database)，网络(LAN, WAN)，系统平台(System Platform)和互连网Internet/Intranet等五个方面。-End system ArkoMaster modular design their own document management software system to develop software. A system management software to achieve the ultimate goal: It is free across the desktop (Desktop), Client/Server, mainframe different levels of management, including management of applications (Applications), database (Database), network (LAN, WAN ), system platforms (System Platform) and the Internet Internet/Intranet and other five areas.
- 2022-03-11 14:13:45下载
- 积分：1
-
Json 的 CRUD
我只是共享代码 CRUD （创建、 读取、 更新、 删除） 使用 php 和 javascript 的数据，这段代码具有功能输入和显示与不 realoaded 你的页面。还有成附件尚未插入数据库的例子。let 的摇滚 ！
- 2022-01-28 05:03:52下载
- 积分：1
-
用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。...
用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。-from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.
- 2023-02-08 08:05:04下载
- 积分：1
-
后缀数存储算法，利用后缀树(sufixtree)存储，搜索数据，可以达到C*O(n)的复杂度...
后缀数存储算法，利用后缀树(sufixtree)存储，搜索数据，可以达到C*O(n)的复杂度-suffix several storage algorithm, the use of the suffix tree (sufixtree) storage, search, which can reach C* O (n) the complexity
- 2023-07-09 09:35:03下载
- 积分：1
-
该源码功能是实现赫夫曼编码，即构造最优二叉树，是字符界面的，自我感觉做的还不错，调试通过的，绝对好用...
该源码功能是实现赫夫曼编码，即构造最优二叉树，是字符界面的，自我感觉做的还不错，调试通过的，绝对好用-The source function is to realize Huffman coding, that is, the optimal tree structure is a character interface, and the sense of self, to do good, debugging adopted, the absolute ease of use
- 2023-08-12 19:10:03下载
- 积分：1
-
Java连接MySQL
应用背景在Java数据库连接使用 ； MySQL；NetBeans，注：这里的学生已经创造了在MySQL数据库MySQL root用户名关键技术MySQL connector.jar文件可从网站：wvw.mysql.comNetBeans IDE ； ；7.5MySQL 5.51
- 2022-08-15 09:25:59下载
- 积分：1
-
Computes estimates for the number of fores ts of a graph. input as a 0
Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.
- 2022-02-05 15:36:49下载
- 积分：1
-
求解约瑟夫问题。设有n个人围成一个圆圈坐下，对所有围从的人从某个位置开始编号为1,2,3，……，n,从编号为1的人开始报数1，报数依交进行，报数n的人即出列，下...
求解约瑟夫问题。设有n个人围成一个圆圈坐下，对所有围从的人从某个位置开始编号为1,2,3，……，n,从编号为1的人开始报数1，报数依交进行，报数n的人即出列，下一个人从1开始报数，再报数m的人便是第二个出列的人如此重复下去，直到最后一个人出列为止，于是便得到一个出列的顺序，这称之为约瑟夫(Josephu)问题。-solving problems. N individuals have formed a circle to sit down, all right Wai from the start from a position of No. 1, 2, 3, ..., n, for a number of people reported a few, according to several newspaper pay, the newspaper n ie the out, the next person was from the beginning a few , and reported m is the second out of this series continue to repeat until the final out in a series, then get a series out of order, which called Joseph (Josephu) problem.
- 2022-05-21 23:13:13下载
- 积分：1
-
几种数据结构算法的C程序实现
几种数据结构算法的C程序实现-several data structure algorithm C Programming
- 2022-01-26 04:48:58下载
- 积分：1
-
List控件的使用,具有可编辑功能,方便的界面配置方法
List控件的使用,具有可编辑功能,方便的界面配置方法-List controls the use of editing features with a convenient way to interface configuration
- 2023-04-14 14:10:02下载
- 积分：1
