Software & Application Skills
2006-12-25 01:09:03 · 5 answers · asked by b. aniruddha 1 in Science & Mathematics ➔ Mathematics
Please look this up on wikipedia:
http://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg
2006-12-25 02:35:24 · answer #1 · answered by Anonymous · 0⤊ 0⤋
Seven Bridge Problem
2016-12-16 09:44:28 · answer #2 · answered by Anonymous · 0⤊ 0⤋
This is one instance of the Eular path problem.
It is studied in graph theory, especially in Computer Science.
It is related to a network of places connected by lines(not necessary that each point is connected to each other point by lines. Some may be connected to nothing or some of the other points. Any combination is allowed.)
It asks whether it is possible that by starting at some point you can visit all lines without crossing any line more than once.
The answer says that if each point is connected to an even number of other points or only two points are linked to an odd number of other points, then there is a path that goes over all lines exactly once.
2006-12-25 05:27:17 · answer #3 · answered by mulla sadra 3 · 0⤊ 0⤋
walk over the roada by crossing every bridge only once
wjo told you about this problem and why didnt you ask hin / her ?
2006-12-25 17:20:49 · answer #4 · answered by gjmb1960 7 · 0⤊ 0⤋
an acyclical graph is called a forest
2006-12-25 01:19:20 · answer #5 · answered by chi 4 · 0⤊ 2⤋