Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
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$.
Required, but never shown