FIELD OF THE DISCLOSURE

The subject disclosure relates to methods, devices, and systems for determining a target path for a network.

BACKGROUND

The traveling salesman problem is one in which a target path is found between a starting point and stopping point with several intermediate nodes The target path can be a shortest path or most efficient path. Further, the target path includes each and every one of the intermediate nodes. In addition, the starting point and stopping point can be the same node. The calculating of the target path can require many computations and take significant time and processing resources.

