Can you please suggest possible approaches for the following problem:

Find a path through graph vertices so that the distance (sum of edges weights) between two vertex $i$ occurrences would be no more than $D_i$. It is obviously infinite, so I want to have a generator for this path.

Thanks in advance.


1 Answer 1


This problem is PSPACE-complete even in the case in which the edge weights obey the triangle inequality. See


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.