I'm studying for a final and when looking for the shortest path in a graph from one vertex to another, what is meant by k-skips?
One website defines it as the ability to change the weight of one edge to zero, as if you don't include it in the path distance.
Another one defines it as:
$P*$ is a k-skip shortest path from s to t, if it includes at least a vertex out of every k consecutive vertices in P
Which I can't seem to understand. I would appreciate some clarification in the matter.