We have a graph where we want to get from node u to v in the shortest path possible.
I understand how Bellman-Ford works when we have exactly i edges to go from u to v or at most i edges to get from u to v. But how does this work when you have to go from u to v with at least k number of edges?
Is this a simple variation of bellman-ford or is there more to this problem?
So far my reading material has been: DPV, Wikipedia, and online publications
Would someone be able to shed some light on this topic?