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