-
12.7
设计一个算法，按照深度优先遍历的思想找出从指定结点出发，长度为M的所有简单路径。并将此算法用于邻接表类，在邻接表类中定义一个共有成员函数find(start, m)。(In adjlink to class with negative right value realization monosource shortest path function. Design an algorithm, according to traverse the depth first thoughts from specified node to find out, based on all of the simple length for M path. This algorithm is used for adjlink to class, defined in the class in adjlink to a mutual member function find (start, m).)
- 2012-03-24 22:45:24下载
- 积分：1
-
数据结构来解决迷宫：一个非迷宫
数据结构迷宫求解：用非递归方法求迷宫路径-Data structure to solve the maze: a maze with non-recursive method, to calculate the path
- 2022-03-07 20:51:32下载
- 积分：1
-
汉语拼音对照表
汉语拼音对照表，xls文件，带汉字的拼音、声调，可转换成数据库用于数据查询。参考文件Unihan.txt-correction Pinyin CRT, the original schedule from the Internet to collect and then after correction, but without changing the original schedule, based on users change their own circumstances. Unicode Chinese characters are the Chinese characters, reference documents Unihan.txt
- 2022-06-19 21:25:56下载
- 积分：1
-
数据库开发的Visual Basic.NET示例，其中包含了一些典型案例。
Visual Basic.NET数据库开发实例，里面包含一些典型的案例和源码-Visual Basic.NET example of database development, which contains some typical cases and the source
- 2022-02-26 06:13:49下载
- 积分：1
-
use stack train compartments complete rearrangement of the algorithm, is a small...
使用堆栈完成火车车厢重排的算法，是一个小的算法，主要在于学习堆栈的应用。-use stack train compartments complete rearrangement of the algorithm, is a small algorithm, mainly studying the application stack.
- 2022-03-15 17:32:50下载
- 积分：1
-
用友u860数据字典
内容在Access数据库中
用友u860数据字典
内容在Access数据库中
-UFIDA u860 data dictionary content in the Access database
- 2022-12-20 22:50:03下载
- 积分：1
-
反思分贝
一个开源的分布式JSON文档数据库，带有一个愉快而强大的查询语言。
- 2023-06-02 08:50:04下载
- 积分：1
-
遗传算法的源程序，用于多组分样品的拉曼光谱的分析的C语言原程序...
遗传算法的源程序，用于多组分样品的拉曼光谱的分析的C语言原程序 -genetic algorithms
- 2023-03-18 03:25:04下载
- 积分：1
-
广义表的反序
逆置广义表的递归模型如下：
F(LS) = null 若 LS 为空
F(LS) = LS ...
广义表的反序
逆置广义表的递归模型如下：
F(LS) = null 若 LS 为空
F(LS) = LS 若 LS 为原子，且 tail(LS) 为空
F(LS) = append( F(tail(LS)), head(LS) ) 若 LS->tag=0 ，且 LS->tp!=null
F(LS) = append( F(tail(LS), F(head(LS)) ) 若 LS->tag=1
其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS-> tag = 0, and the LS-> tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS-> tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.
- 2022-03-01 20:55:59下载
- 积分：1
-
LUZHOUYUE
说明： 今天，小 G 已了解到修理厂共有 m 种不同的修理原料，对于第 i 种原料，可以对任意一个石桥的美化度增加 di，当然这也需要花费 hi 的费用。由于发货场的修理原料有限，对于任意一种修理原料，只有一件，也就是说小 G 只能选择购买和不购买，对于第 i 种修理材料能成功修理第 j 个石桥的条件是：当且仅当 hi ≥ pj，di ≥ vj。现在，已知这 n 个石桥修理的最小花费值，最小美化需求度，以及 m 种修理原料的费用，可对石桥增加的美化度值，请你帮助小 G 完成这个修理任务。(Today, Xiao G has learned that there are m different repair materials in the repair shop. For the first material, Di can be added to the beautification of any stone bridge. Of course, it also costs hi. Because of the limited repair materials in the delivery yard, there is only one repair material for any kind of repair material, that is to say, small G can only choose to buy or not to buy. For the first repair material, the condition for successful repair of the jth stone bridge is: if and only if hi is greater than pj, Di is greater than vj. Now, the minimum cost of repairing n stone bridges, the minimum demand for beautification, and the cost of m kinds of repairing materials are known, which can increase the beautification value of stone bridges. Please help Xiao G to complete this repairing task.)
- 2020-12-05 13:29:23下载
- 积分：1
