title: An algorithm to check if a vertex is reachable
body: <p>Is there an algorithm that can check, in a directed graph, if a vertex, let's say V2, is reachable from a vertex V1, without traversing all the vertices? </p>