Editing 2694: Königsberg

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 11: Line 11:
 
==Explanation==
 
==Explanation==
  
[[File:Konigsberg_bridges.png|frame|right|{{w|Königsberg}}, Prussia in Euler's time, showing the Pregel river and its seven bridges. Two of the original seven bridges no longer exist,[https://goo.gl/maps/ChdBoeQMr3AQPi446] although there are three new bridges. The Baltic port city is now Kaliningrad, a Russian exclave.]]
+
[[File:Konigsberg bridges.png|frame|right|{{w|Königsberg}}, Prussia in Euler's time, showing the Pregel river and its seven bridges. Two of the original seven bridges no longer exist,[https://goo.gl/maps/ChdBoeQMr3AQPi446] although there are three new bridges. The Baltic port city is now Kaliningrad, a Russian exclave.]]
  
 
This comic is about the {{w|Seven Bridges of Königsberg}}, a seminal {{w|graph theory}} problem solved by the famous mathematician {{w|Leonhard Euler}}.[https://www.maa.org/press/periodicals/convergence/leonard-eulers-solution-to-the-konigsberg-bridge-problem] The problem was whether a path through the city crossing each of the seven bridges just once exists, without crossing the river forks any other way. In 1736, Euler proved that no such path exists. This result is considered to be the first theorem of graph theory and the first proof in the theory of networks[http://www-personal.umich.edu/~mejn/courses/2004/cscs535/review.pdf] — a subject now generally regarded as a branch of {{w|combinatorics}} — and presaged the development of {{w|topology}}. Combinatorial problems of other types had been considered since antiquity. {{w|Graph (discrete mathematics)|Graphs}} are a data structure common in many algorithmic problems in computer science.
 
This comic is about the {{w|Seven Bridges of Königsberg}}, a seminal {{w|graph theory}} problem solved by the famous mathematician {{w|Leonhard Euler}}.[https://www.maa.org/press/periodicals/convergence/leonard-eulers-solution-to-the-konigsberg-bridge-problem] The problem was whether a path through the city crossing each of the seven bridges just once exists, without crossing the river forks any other way. In 1736, Euler proved that no such path exists. This result is considered to be the first theorem of graph theory and the first proof in the theory of networks[http://www-personal.umich.edu/~mejn/courses/2004/cscs535/review.pdf] — a subject now generally regarded as a branch of {{w|combinatorics}} — and presaged the development of {{w|topology}}. Combinatorial problems of other types had been considered since antiquity. {{w|Graph (discrete mathematics)|Graphs}} are a data structure common in many algorithmic problems in computer science.

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)