Lab 10: Modified DFS

• Download the following files:
  • lab10.java
  • Graph.java
  • Vertex.java
  • graph.txt
  • graph2.txt

• Study the "simplified" implementation of the Graph ADT present in Graph.java
• Implement the following method in lab10.java
  • ModDFS(Graph g, Vertex v, int depth, LinkedList s) that returns a list s of nodes in the directed graph g from v that can be reached using no more than depth edges.
• Compile and run lab10.java with different arguments

> java lab10 graph.txt B 2
--------------------------------------------------------------------------------
The nodes [C, G, F, J, A] can be reached from node B using no more than 2 edges.
--------------------------------------------------------------------------------

> java lab10 graph2.txt A 4
--------------------------------------------------------------------------------
The nodes [D, E, B, C, G, J, F, X, Y] can be reached from node A using no more
than 4 edges.
--------------------------------------------------------------------------------

> java lab10 graph2.txt B 3
--------------------------------------------------------------------------------
The nodes [C, G, J, F, A, D, Y, X] can be reached from node B using no more than
3 edges.
--------------------------------------------------------------------------------