"Algorithm Secret" Google trips has 280 years of ancient algorithms reveal

The interesting thing about algorithmic engineering is that it never goes out of style, doesn't know when the older but useful algorithms may be reflected in our design, yesterday, Google released its Google trips, a new app to help you create a very good trip in the city. And the algorithm has been demonstrated 280 of years ago.

In 1736, Euler published the famous paper on the Seven Bridges of Konigsberg, seven bridge problems, as follows:
650) this.width=650; "src="%5c "alt=" \ "image_01\" "title=" \ "image_01\" "/>

In this paper, Euler studies the following questions: Can the traveler all the bridges will be able to stroll through the entire city (the mainland is separated by seven bridges)? The final paper gives the result, for Konigsberg this city, can not. In order to prove that Euler proposed a so-called positional geometry concept is the later development of graph theory. In this paper, the continents of all cities are called nodes by bridges, while bridges across continents are called edges. Such as:

650) this.width=650; "src="%5c "alt=" \ "image_02\" "title=" \ "image_02\" "/>

The necessary and sufficient condition for Euler to discover this path is that all nodes must have even-numbered edges. Only in this condition can one pass through all continents, and all the bridges go only once; based on the above findings, we apply it to Google trips.

Our team's theoretical research on this positional geometry has been going on for a while, and then our research is based on the Euler theory of whether we can make the traveler walk as far as possible, and this problem is now the "trip planning" problem. Euler has not studied this problem, but based on Euler's inspiration, we call it a directed engineering problem.

Euler's solution is perfect and very correct, but the itinerary is really a headache, because there is no perfect solution, only to find the perfect solution as close as possible. The main reason is that there are two dimensions that are contradictory: for example, to visit the better sights, but the timing of the arrangements need to be the most economical, second, you need to consider the attractions do not close the door, to consider the closing time, and even do not stroll too many museums (no one would like to play a continuous museum). The problem of so many constraints has been attributed to the "traveler" problem.

To continue reading please click: http://click.aliyun.com/m/9169/

This article is from the "12466150" blog, please be sure to keep this source http://12476150.blog.51cto.com/12466150/1890765

"Algorithm Secret" Google trips has 280 years of ancient algorithms reveal