USING JAVA:

Create a class: AdjListGraph.java, and just submit AdjListGraph.java. where

-Step 1(1 credit):

Please implement a graph by adjacency list.

-Step 2(1 credit):

Write a method: void dfs(){\\ TO-DO}; which can traverse a graph by DFS(stack based or recursive)