-
本软件实现对数据进行高级加密,值得一看,不可错过.
本软件实现对数据进行高级加密,值得一看,不可错过.-the right software for advanced data encryption, an eye-catcher, not to be missed.
- 2022-04-10 06:14:21下载
- 积分：1
-
Prime number algorithm of the program to quickly calculate the first n a prime n...
素数算法的程序，能快速计算出前n个素数
- 2022-01-26 05:43:43下载
- 积分：1
-
最小生成树
给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)
- 2017-06-05 17:27:17下载
- 积分：1
-
C#中，应用程序与数据库access的链接解释
C#中，应用程序与数据库access的链接解释-C#, applications and database access links to explain the
- 2022-07-09 06:23:46下载
- 积分：1
-
功能强大的查询系统操作方便易懂好用不会繁琐数据库也强大...
功能强大的查询系统操作方便易懂好用不会繁琐数据库也强大-Powerful query system will not be easy to use easy-to-understand red tape is also a powerful database
- 2022-06-27 10:28:27下载
- 积分：1
-
该源码为酒店等使用的源码，使用java语言编写。具有GUI图形界面，使用jdbc来连接数据库。软件架构很合理，尤其是代码很简洁。...
该源码为酒店等使用的源码，使用java语言编写。具有GUI图形界面，使用jdbc来连接数据库。软件架构很合理，尤其是代码很简洁。-The source for the hotel such as the use of the source, use the java language. Graphical interface with a GUI, use jdbc to connect to database. Software architecture is very reasonable, especially in very concise code.
- 2022-11-05 20:50:03下载
- 积分：1
-
Java写的部分数据结构源码
Java写的部分数据结构源码-Written in Java source code part of the data structure
- 2022-06-02 17:30:30下载
- 积分：1
-
用c写的数据结构问题
数据结构的二叉-the binary tree data structure tr
- 2022-01-28 18:30:09下载
- 积分：1
-
pinfanfangwen
设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
- 2015-01-15 22:31:59下载
- 积分：1
-
ds-labs
说明： 数据结构基本算法实现。包括栈、二叉树基本运算实现，同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)
- 2011-03-27 03:01:02下载
- 积分：1
