Problem solve me this.

[PaulStat]

Help me problem solve folks, it's a Friday afternoon and i've had a couple of beers, so me brain isn't fully engaged.

b--->c--->d--->e
^         ^     |
|         |     |
|         |     |
|         |     |
|         |     ->a-------
|         |          |    |
|         -----------     |
|                         |
--------------------------

On the first run start from a, go through b etc. Second run through start at a go to d then e. The problem is b needs information from c and d, c needs information from b and d needs information from c. Argh me brain is frazzled, help meeee

Edit: forgot to say, re-organise or add another intermediate step to the above to make sure they all have the required information.

Edit2: They all have to go in order, so it's not like you can jump forwards to grab the required information you need.

 

[PaulStat]

2nd route, take the same route as first time, goes to d and e aswell as passing through b + c

nb: That could be cheating, but i'm a bit confused at the question still.

Yes but you have to start from a, and b requires information from d from the first time round.

Same applies to c requiring info from b.

Therefore you can't just put d before b, since d requires c and c requires b

Argh