Is there a known algorithm for the following problem?  Given a simple weighted directed graph, a pair of vertices $s$ and $t$, and a real value $k$, enumerate all simple paths from $s$ to $t$ with cost exactly $k$.I've heard of uniform search, but I'm not really sure if it can solve my problem.I just read that finding one $s$-$t$ path with a given cost is NP-hard in general.  If all weights are $1$ and $k$ is one less than the number of vertices, this becomes the Hamiltonian Path Problem.
Enumerating all s-t paths with cost exactly k
graph theory;graph algorithms