The complexity of an inverse shortest paths problem