## Simple path containing three given nodes

Let $G=(V,E)$ be an undirected graph. Describe a linear time algorithm that given $G$ and three distinct nodes $u,v,w$ decides whether there is a simple path in $G$ that contains all of them.

0

0

0

0

0

0

0

0

0

0