Route problem

[Disch]

You should print the paths so you can see what paths its finding. It makes it easier to debug.

But when I try D->A it says it has found 4 paths, when there are only 3 possible paths.

There are at least 4 paths:

DHGBEA
DHCFBEA
DHCFIEA
DHGBFIEA

And I->A will produce 6 paths, when there are only 3.

This is strange... it looks like it's finding each path twice.

See line 93.

What exactly is that for loop supposed to accomplish?


EDIT:

Looks like you edited to change your code. I'm not sure what you changed but it looks like my line 93 reference is no longer good.

I was referring to the for loop in the travel() function.

I'm a little weary as to what else you changed to fix this problem.

[blackcoder41]

sorry i can't code right now its 1:52 am here. gotta goto sleep. surely i will help you tomorrow if it is still not finish.

[GRH]

I've already solved that problem Disch, but thanks :)
Now I'm displaying each found path with temp_routes which seems to work just fine! I might just get this after all :D