x Turn on thread page Beta
 You are Here: Home >< Maths

# As maths help: Eulerian trials. Chinese postman problem. watch

1. So basically i'm teaching myself how to do Eulerian Trials. I understand it very well except from questions like this which I just can't get my head around.
Attachment 572952572954Attachment 572952572954572900

For the first problem:
I'm having trouble understand what the question is asking me? Is it asking me to write out the LETTER PATH starting and ending at G, including the path DCG twice?!? Arrghh i'm really stuck please can someone help me?

For the last question I have learnt that you add up all the lengths including DCG twice and then times it by 100? Is this right too?

For the second problem:
The graph is semi eurlerian so if I start and one odd vertex (C) and finish at the other (G), that means I don't have to repeat anything, right??

Thank you in advance for anyone who helps me. Please explain simply as I have done NO AS maths as yet.
If anyone is feeling extra kind, could you link me to a useful website on eurlerian trials or take a picture of your textbook on the topic and upload it for me? Thanks.
Attached Images

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: August 18, 2016
Today on TSR

### Four things top students are doing

Over the Easter break

Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams