Finds a path between two nodes in a graph.
Different types of graphs use different algorithims to
find the paths. a DirectedGraph uses breadth-first search
while an DirectedAcyclicGraph uses topological sort.
The path is represented as a character vector with the node ids of the nodes that make up the path.