The problem known as the Seven Bridges of Könisberg:The city of Königsberg, Prussia was set on the Pregel River, and included two large islands which were connected to each other and the mainland by seven bridges. The problem is to decide whether it is possible to follow a path that crosses each bridge exactly once and returns to the starting point...
anybody?
5 comments:
i am not gettin any damning answer!!!!!! aaargh!
but i will try! n dontcha dare giv it 2 me! :P
just not possible, unless you remove the river :P
hey welcome!amitej yep it aint possible:
In 1736, Euler solved the problem known as the Seven Bridges of Königsberg.[26] The city of Königsberg, Prussia was set on the Pregel River, and included two large islands which were connected to each other and the mainland by seven bridges. The problem is to decide whether it is possible to follow a path that crosses each bridge exactly once and returns to the starting point. It is not: there is no Eulerian circuit. This solution is considered to be the first theorem of graph theory, specifically of planar graph theory.
sounds like a lotta hogwash but euler said so ...
The real problem ain't deciding if it is possible or not. Its proving what you say.
Post a Comment