-
e learing system
该项目旨在开发一个电子学习门户网站
- 2022-05-30 15:50:19下载
- 积分：1
-
数据结构练习共18道。
数据结构练习共18道。-data structure to practice a total 18.
- 2022-02-16 03:06:05下载
- 积分：1
-
一个有趣的算法。。。十分有趣
一个有趣的算法。。。十分有趣-an interesting algorithm. . . Very interesting
- 2022-05-25 23:26:43下载
- 积分：1
-
数据库技术在大部分的软件及网络都离不开的，这里给大家共享ACCESS 2007的精品教程...
数据库技术在大部分的软件及网络都离不开的，这里给大家共享ACCESS 2007的精品教程-Database technology in the majority of software and networks can not be separated, and here to share the excellent tutorial ACCESS 2007
- 2022-07-08 06:48:05下载
- 积分：1
-
tree traversal of the four, China and Syria, the former sequence after sequence...
树的四种遍历方式，中叙，前序，后序和按层遍历算法，前三个用递归很好实现，最后一个复杂点。-tree traversal of the four, China and Syria, the former sequence after sequence and by layer traversal algorithm, the former three Recursive properly achieved, Finally a complex point.
- 2022-08-17 13:05:30下载
- 积分：1
-
数据结构停车场问题
数据结构停车场问题-data structure parking problems
- 2022-03-04 11:59:35下载
- 积分：1
-
pb 源码 实用例子 取硬盘序列号
pb 源码 实用例子 取硬盘序列号-pb source of practical examples from hard drive serial number
- 2023-07-17 16:05:03下载
- 积分：1
-
Pre
前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。
其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。
其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。
算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in
- 2023-01-02 04:10:18下载
- 积分：1
-
的Kruskal最小生成树算法Mathematica软件应用
MATHEMATICA 软件运用
最小生成树的Kruskal算法-MATHEMATICA software application of the Kruskal minimum spanning tree algorithm
- 2022-01-27 19:27:15下载
- 积分：1
-
栈(stack)是程序设计过程中经常遇到朝气一种数据结构形式，它对于数据的存放和操作有下面这样的特点： 1) 它只有一个对数据进行存入和取出的端口； 2) 后进...
栈(stack)是程序设计过程中经常遇到朝气一种数据结构形式，它对于数据的存放和操作有下面这样的特点： 1) 它只有一个对数据进行存入和取出的端口； 2) 后进者先出，即最后被存入的数据将首先被取出。其形式很象一种存储硬币的小容器，每次只可以从顶端压入一个硬币，而取出也只可以从顶端进行，即后进先出。 这样的数据存储和管理形式在一些程序设计中很有用。例如，编译系统中(这是一类比较复杂的程序)，对于函数调用的处理、对于表达式计算的处理，都利用了栈这样的数据结构。- The stack (stack) is in the programming process frequently
meets the vitality one kind of construction of data form under, it has
such characteristic regarding data depositing and the operation: 1) it
only has a logarithm according to the port which carries on stores and
takes out; 2) less advanced first leaves, namely finally the data
which will store first is taken out. Its form looks like one kind of
memory coin very much the small container, each time only may press in
a coin from the peak, but takes out also only may carry on from the
peak, namely less advanced first leaves. Such data storage and the
management form are very useful in some programmings. For example, in
the compiling system (this is a kind of quite complex procedure),
transfe
- 2023-08-22 21:50:04下载
- 积分：1
