yan1990gr
Badges: 0
Rep:
?
#1
Report Thread starter 5 years ago
#1
I have no idea how to beginn with this...
We have a network 8x8 of a big chessboard. The 81 grid points are the crossroads. The crossroads are linked with the neighboring crossroads through edges of 1 m length horizontally and vertically. The horizontal streets can be crossed in both directions. The vertical 1st, 3rd, 5th, 7th and 9th streets from up to down and the 2nd, 4th, 6th, 8th from down to up. In this described graph can only the four fields in the centre of the chessboard turn clockwise to 90 degrees including the street orientation. The minimum number of visited edges of the optimal solution of this graph's chinese postman problem's is then:


22

23

24
0
reply
X

Quick Reply

Attached files
Write a reply...
Reply
new posts
Back
to top
Latest
My Feed

See more of what you like on
The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

Personalise

Feeling behind at school/college? What is the best thing your teachers could to help you catch up?

Extra compulsory independent learning activities (eg, homework tasks) (2)
3.7%
Run extra compulsory lessons or workshops (7)
12.96%
Focus on making the normal lesson time with them as high quality as possible (8)
14.81%
Focus on making the normal learning resources as high quality/accessible as possible (6)
11.11%
Provide extra optional activities, lessons and/or workshops (21)
38.89%
Assess students, decide who needs extra support and focus on these students (10)
18.52%

Watched Threads

View All