SO Assignment can be thought of as a model in which congestion is minimized when travelers are told which routes to use.

Based on the selected benchmark of evaluation, users only needed to specify the start and goal, then system could automatically find out the best route.

It is also shown that the postman route obtained by this approximation algorithm is optimal if the given windy graph is Eulerian.