Skip to main content
. 2015 Mar 31;15(4):7768–7806. doi: 10.3390/s150407768
Algorithm 5. Get next node
Require: Adjacent nodes Ad = {k1,…,kn} not empty
Require: Actual node actual
1: min = NotExists
2: for k in Ad do
3: 	  if use(actual,k) < capacity(actual,k) AND
                           congestion(actual,k) < congestion(actual,min)
4: 	  	min ← k
5: 	  end if
6: end for
7: return min