From Skiena's book The Algorithm Design Manual, chapter 6, problem 22:Let $G = (V,E,w)$ be a directed weighted graph such that all the weights are positive. Let $v$ and $u$ be two vertices in $G$ and $k \leq |V|$ be an integer. Design an algorithm to find the shortest path from $v$ to $u$ that contains exactly $k$ edges. Note that the path need not be simple, and is permitted to visit vertices and edges multiple times.This is not homework, its me preparing for an interview. I have no clue how to approach this.
Shortest path with exactly $k$ edges
algorithms;graph theory;shortest path