Seven Bridges of Königsberg
Version 1.0.0 · Updated 2026-07-28
CORE DEFINITION
The Seven Bridges of Königsberg (German: Königsberger Brückenproblem; English: Seven Bridges of Königsberg) is a famous problem in graph theory. It is based on a real-life situation: at that time, the city of Königsberg in East Prussia (now Kaliningrad, Russia) spanned both banks of the Pregel River, with two islands in the center of the river. The islands were connected to the banks and each other by seven bridges. The question was: how could one walk through the city crossing each bridge exactly once?
SCAFFOLDING EFFECT
Reduce cognitive load
The Seven Bridges of Königsberg (German: Königsberger Brückenproblem; English: Seven Bridges of Königsberg) is a famous problem in graph theory. It is based on a real-life situation: at that time, the city of Königsberg in East Prussia (now Kaliningrad, Russia) spanned both banks of the Pregel River, with two islands in the center of the river. The islands were connected to the banks and each other by seven bridges. The question was: how could one walk through the city crossing each bridge exactly once?
Anchor fast decisions
Euler abstracted the question of whether one could cross all seven bridges exactly once into a graph theory problem: an Eulerian path exists if and only if the number of vertices with odd degree is 0 or 2. The city did not satisfy this condition, so it was impossible.
MINIMUM ACTION
In progress 0/3Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- zh.wikipedia.orghttps://zh.wikipedia.org/wiki/%E6%9F%AF%E5%B0%BC%E6%96%AF%E5%A0%A1%E4%B8%83%E6%A1%A5%E9%97%AE%E9%A2%98verified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS