PS 11. Does anybody solved the PS such as it passes all the tests?

Example:
A-B 10
A-C 3
C-B 3
B-D 1
B-D 6
Looking for path from A to D.
Optimal: A-C-B-D with weight 7
If B was visited before C (B is in "visited" list) we will get A-C-D with weight 9 that is not optimal solution. How do you fix it?
I've set up the algorithm to remember passed edges instead of vertexes, but it runs times times longer.

Question

PS 11. Does anybody solved the PS such as it passes all the tests?

Example:
A->B 10
A->C 3
C->B 3
B->D 1
B->D 6
Looking for path from A to D.
Optimal: A->C->B->D with weight 7
If B was visited before C (B is in "visited" list) we will get A->C->D with weight 9 that is not optimal solution. How do you fix it?
I've set up the algorithm to remember passed edges instead of vertexes, but it runs times times longer.

anonymous · Answer

Found a fixture: don't add all visited vertices to "visited" list. Add only the root node, that is a start node for the next recursion cycle. Thereby visited list will contain only vertices that are visited in current path.