Add a new method in AbstractGraph to find a path between two vertices with the following header:
public List getPath(int u, int v);
The method returns a List that contains all the vertices in a path from u to v in this order. Using the BFS approach, you can obtain a shortest path from u to v. If there isn’t a path from u to v, the method returns null.