# Find path from s to t that goes through another node w

If you have directed and unweighted graph G how could you find a path from node s to node t that also goes through another node w? This could be a non-simple path.

If you don't care about simplicity, a path from $s$ to $t$ that goes through $w$ is just a path from $s$ to $w$ concatenated with a path from $w$ to $t$.