A bit more accurately, random traversal alone can’t solve the problem:
- Randomly traverse all vertices, keeping only those that satisfy the
property.
- Find the shortest path from the initial vertex to each of the
retained vertices, keeping the vertex at the end of the shortest path
overall.
This page last modified on 24 January 2006.