-
-
Dij.rar
Dijkstra algorithm to show how to find shortest path
-
usb-thesis.zip
Finding Your Device
Obtaining a device path name requires these steps: API
-
-
dijkstra_hd.zip
greedy algorithm used to calculate the shortest path and cost
-
Shortest_Path_Algo.zip
TSP is a shortest path calculator, which means it find the shortest path in which to go through a specific number of points.
-
12.rar
... ，解析出命令名和参数；
（4）寻找命令文件：每个命令的执行都必须依靠对应的可执行文件，这些文件的存放路径存放在用户的PATH环境变量里；
（5）执行命令：可通过fork( )系统调用创建一个进程来完成执行命令的任务，具体的命令执行用execv( )函数。
-
TSP_TS.rar
... and some data to test the appllication.
As an input, we take the coordinates of cities (x,y) and then transform them into distances matrix. All computations are performed on that matrix.
The output is the shortest found path between all the cities.
-
TSP_SA.rar
... transform them into distances matrix (we assume, the distance between x and y is the same as between y and x). All the computations then are performed on such matrix.
The output is the shortest path between all cities, the algorithm was capable to find.
-
canyin.rar
... ()
Left = 0
Top = 0
If PIC_load Then
Me.Picture1.Picture = LoadPicture(App.Path & "\pic\pic0001.jpg")
End If
Adodc1.ConnectionString = My_PROVIDER
Adodc1.CommandType = adCmdText
Adodc1.RecordSource = " ...
-
-
Go To English Version 超过100万源码资源，1000万源码文件免费下载
