-
personal finishing java learning materials, hoping to let it vb friends a little...
个人整理的java学习资料,希望给想学vb的朋友一点帮助。winrar压缩,没有解压密码。-personal finishing java learning materials, hoping to let it vb friends a little help. WinRAR compression, decompression no password.
- 2023-02-26 18:15:06下载
- 积分:1
-
简单的鼠标操作,主要用的是MFC编程,使用了几个控件
简单的鼠标操作,主要用的是MFC编程,使用了几个控件-simple shubiao
- 2022-07-05 05:52:01下载
- 积分:1
-
交易的米罗
Transaction Miro - SAP R/3-Transaction Miro- SAP R/3
- 2023-03-25 09:55:04下载
- 积分:1
-
Getting Started with JBoss 4.0 Release 5 Th e goal of this book is to get you up...
Getting Started with JBoss 4.0
Release 5
The goal of this book is to get you up and running J2EE 1.4 applications on JBoss 4.0 as quickly as possible.-Getting Started with JBoss 4.0 Release 5 Th e goal of this book is to get you up and running J2E E 1.4 applications on JBoss 4.0 as quickly as pos sible.
- 2022-03-18 08:09:08下载
- 积分:1
-
VC small dictionary on the C function
VC小词典,查询C函数-VC small dictionary on the C function
- 2022-08-24 17:37:54下载
- 积分:1
-
** program because of autoclave crm
**压力锅crm方案-** program because of autoclave crm
- 2022-06-03 19:00:18下载
- 积分:1
-
JavaMail practical example of a procedure
javamail实用的一个程序事例-JavaMail practical example of a procedure
- 2023-08-13 21:35:03下载
- 积分:1
-
关于Wicnce的一本英文书籍挺经典的《Windwos Embedded CE6.0 Fundamentals》
很全面的...
关于Wicnce的一本英文书籍挺经典的《Windwos Embedded CE6.0 Fundamentals》
很全面的-With regard to Wicnce" s a pretty classic books " Windwos Embedded CE6.0 Fundamentals" very comprehensive
- 2022-05-22 10:08:04下载
- 积分:1
-
VC在线杂志精华15
VC在线杂志精华15-VC-15 best magazines
- 2022-02-16 09:15:27下载
- 积分: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