-
http protocol
http协议-http protocol
- 2022-03-22 21:21:33下载
- 积分:1
-
This article introduces a triangular shapes and forms under the cloud of the bor...
文章介绍了在三角面片和点云形式下特征边界的提取方法。-This article introduces a triangular shapes and forms under the cloud of the border extraction methods.
- 2023-02-19 08:15:03下载
- 积分:1
-
PSPISE教程orcad9.0学生版
pspise tutorial on orcad9.0 student edition
- 2022-03-17 19:56:50下载
- 积分:1
-
学习如何在C++内存管理
Learn how to Memory Management in C++
through these document.
- 2022-12-23 00:40:03下载
- 积分:1
-
MFCWindows程序设计(第二版)(中文版)的全部配套源代码
MFCWindows程序设计(第二版)(中文版)的全部配套源代码-MFCWindows Program Design (Second Edition) (Chinese version) of all supporting source code
- 2022-11-12 21:55:04下载
- 积分:1
-
Effective C Third Edition 55 Specific Ways to Improve Your Programs and Designs...
Effective C++ Third Edition 55 Specific Ways to Improve Your Programs and Designs
By Scott Meyers
...............................................
Publisher: Addison Wesley Professional
Pub Date: May 12, 2005
Print ISBN: 0-321-33487-6
Pages: 320
-Effective C Third Edition 55 Specific Ways to Improve Your Programs and Designs By Scott Me yers .............................. ........... Publisher : Addison Wesley Professional Pub Date : May 12, 2005 Print ISBN : 0-321-33487-6 Pages : 320
- 2022-04-28 04:44:04下载
- 积分:1
-
一些纠错编码的c程序实现,包括bch码,rs码,均已调试通过
一些纠错编码的c程序实现,包括bch码,rs码,均已调试通过-some of the c-correction coding program, including BCH code, rs codes have been adopted Debugging
- 2022-05-17 13:51:27下载
- 积分:1
-
uijijjijui.zip
uijijjijui.zip
- 2022-04-29 05:02:29下载
- 积分:1
-
经典的programming challenges(英文版)
经典的programming challenges(英文版)-Classic programming challenges (English)
- 2022-06-11 15:34:41下载
- 积分:1
-
A* (A
A*(A-Star)算法是一种静态路网中求解最短路最有效的方法。
公式表示为: f(n)=g(n)+h(n),
其中f(n) 是节点n从初始点到目标点的估价函数,
g(n) 是在状态空间中从初始节点到n节点的实际代价,
h(n)是从n到目标节点最佳路径的估计代价。
-A* (A-Star) algorithm is a static network shortest path in solving the most effective way. Formula is expressed as: f (n) = g (n)+ H (n), in which f (n) is a node n from the initial point to the target point of the valuation function, g (n) in state space from the initial node to node n of the actual cost, h (n) from n to the target node of the estimated cost of the best path.
- 2022-01-25 23:27:36下载
- 积分:1