-
-
-
RoutingAsOptimization.rar
... Problem
Routing in Wireless sensor networks can be viewed as an optimization problem in which there is a need to find the optimal path (which is not necessarily the shortest one) in terms of some parameters like energy, delay and reliability.
-
-
-
-
-
-
-
Dijkstra.rar
... in 1959is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other ...
-
TSP.zip
... i
S[M] = 0
T = 1000 //初始温度1000
Tl = 35000 //内循环次数35000
a = 0.93 //温度下降系数
k = 0
PreMin = 0
Path = GetPath(S)
srand((unsigned)time( NULL ))
cout<<"The initial Path Distence is: "<<Path<<endl
return true
-
Go To English Version 超过100万源码资源，1000万源码文件免费下载
