- weighted directed graph $G = (V,E,w)$, where $w : E \to \mathbb R^+$
- source vertex $v \in V$
- vertex subset $U \subset V$
how to find a shortest directed path from $v$ containing all vertices from $U$? Note that such path may contain vertices that are not in $U$.
- Does such problem have a name?
- How to find a solution?