Routing Optimization Algorithms Based on Node Compression in Big Data Environment

Algorithm 1

The key pseudocode of the improved backtracking algorithm.

Improved-Backtrack ()

node=start

while usedtime<  &&

(node!=end && !∈ nodes)

nodes.add(node)

record information include

route and weigths

for to children.length

add search rule

Improvedacktrack (children[])

if result !=null-

return result and weight

else

return NA