In the following class, A Perform the DFS method that returns by adding it to the list according to the order.

= import java.util.*; //directed graph public class Graph { Map> adj; public Graph() { adj = new HashMap>(); } public void addVertex(String label) { Vertex v = new Vertex (label); Set vset - new HashSet->(); adj.put(v, vset); 1 public Set getNeighbors (Vertex v) { Set vset - adj.get(v); return vset; ) public Set getNeighbors (String label) { Set vset - adj.get(new Vertex (label)); return vset; ) Page 2 public void addEdge (Vertex u, Vertex v) { Set uset = getNeighbors (u); uset.add(v); adj.put(u, uset); } public void addEdge (String u, String v) { Set uset = getNeighbors (u); uset.add(new Vertex(v)); adj.put(new Vertex(u), uset); } 1/DFS algoritmasini kullanarak ziyaret edilen vertezleri bitis sirasina gore listeye ekleyerek retum eder public List DFS (Vertex s) {