between vertices in a directed graph Given a directed graph $G = (V,E)$ and two vertices $a,b \in V$, how can we find a path in $G$ between them? Sometimes we will also have a weighting $W: E \rightarrow D$ and we want to minimise the path length.