Skip to main content
. 2015 Mar 31;15(4):7768–7806. doi: 10.3390/s150407768
Algorithm 1. Global congestion (GC)
Require: Vehicle’s destination node d
Require: All potential paths to d: paths={p1,  ,pn}
1: Sort paths (A to Z) by congestionpi
2: Path path=paths[0]
3: pathv=path
4: return pathv