-
prim minimum spanning tree algorithm tectonic map of the network or matrix and a...
普里姆构造最小生成树算法 图或网的邻接矩阵表示及其上基本算法的实现-prim minimum spanning tree algorithm tectonic map of the network or matrix and adjacency on the realization of basic algorithm
- 2023-02-02 08:40:04下载
- 积分:1
-
superobject
superobjectv1.2.4 SuperObject 是开源的 Delphi 的 JSON 工具包,可生成 JSON 数据以及进行 JSON 解析
- 2022-08-18 05:32:41下载
- 积分:1
-
ISO 14498
ISO 14498 -2 MPEG4规范中的音频和视频部分标准-INFORMATION TECHNOLOGY-
CODING OF AUDIO-VISUAL OBJECTS: VISUAL
ISO/IEC 14496-2
Committee Draft
- 2022-07-25 07:07:36下载
- 积分:1
-
数据压缩的一些基本概念
数据压缩的一些基本概念-data compression some of the basic concepts
- 2022-03-23 06:03:03下载
- 积分:1
-
ARM学习报告003――Bios源码分析.pdf
ARM学习报告003――Bios源码分析.pdf-ARM study reports 003- Bios-source analysis. Pdf
- 2022-02-21 08:56:34下载
- 积分:1
-
147497_ALTERA_ACEX1K.pdf introduce alter acex1k series chip
147497_ALTERA_ACEX1K.pdf介绍alter acex1k系列芯片-147497_ALTERA_ACEX1K.pdf introduce alter acex1k series chip
- 2022-06-30 07:45:41下载
- 积分:1
-
Delphi编字数统计程序
我们都知道,Word里有“字数统计”的功能,但它的“字数统计”功能有一个缺陷:它会把全角符号都视为汉字处理,结果统计的汉字数总是...
Delphi编字数统计程序
我们都知道,Word里有“字数统计”的功能,但它的“字数统计”功能有一个缺陷:它会把全角符号都视为汉字处理,结果统计的汉字数总是大于实际的汉字数,针对这个缺陷,本人编写了这个程序,方法如下-series wordage statistical procedures we all know, there are Word "word statistics" function, But its "words Statistics" is a functional defect : it will turn the whole angle are seen as symbols of Chinese characters, Statistical results of a few Chinese characters are always larger than the actual number of Chinese characters to address the shortcomings, I prepared for the process, as follows
- 2022-02-25 10:02:19下载
- 积分:1
-
lib图书馆理系统~VC++设计的
lib图书馆理系统~VC++设计的-lib library management system designed VC ~ ~~~~~~~~~~~~~~~~~~~~~
- 2022-01-25 17:02:24下载
- 积分:1
-
换乘次数最少是乘客出行时考虑的首要因素。描述了传
统的Dijkstra 算法,并分析了Dijkstra 算法不适合公交网络最优路径选择的原因。最后根据公交乘...
换乘次数最少是乘客出行时考虑的首要因素。描述了传
统的Dijkstra 算法,并分析了Dijkstra 算法不适合公交网络最优路径选择的原因。最后根据公交乘客可以步行小段
距离再转车的实际情况,提出一种基于换乘次数最少的公交最短路径改进算-takes the least number of passenger trips is considered the primary factor. Description of the traditional Dijkstra algorithm. and analysis of the Dijkstra algorithm is not suitable for transit network optimal path of choice. Finally, according to transit passengers will be able to walk away from a transfer above the actual situation, A proposed change to the least number of public transport operators to improve the shortest path
- 2022-02-18 16:52:04下载
- 积分:1
-
1.The content is too simple
2.Is not a sourcecode or document
3.lack of file...
1.The content is too simple
2.Is not a sourcecode or document
3.lack of files
4.Directory or platform is not correct selected
5.Description is not detailed
6.Compressed file has password
7.Sourcecode duplicate or already exist
- 2022-05-16 07:52:50下载
- 积分:1