diff --git a/Solved-Problems/GraphTheory/DFS.java b/Solved-Problems/GraphTheory/DFS.java
new file mode 100644
index 0000000..ec9c1bd
--- /dev/null
+++ b/Solved-Problems/GraphTheory/DFS.java
@@ -0,0 +1,73 @@
+import java.util.ArrayList;
+
+public class DFS {
+    // 1- --3
+    // / | \
+    // 0 | 5--6
+    // \ | /
+    // 2-- - 4
+
+    public static void main(String[] args) {
+        int vertex = 7;
+        @SuppressWarnings("unchecked")
+        ArrayList<Edge> graph[] = new ArrayList[vertex];
+        boolean vis[] = new boolean[vertex];
+
+        createGraph(graph);
+
+        depthFirst(graph, 0, vis);
+        System.out.println();
+    }
+
+    static class Edge {
+        int src;
+        int dest;
+
+        public Edge(int s, int d) {
+            this.src = s;
+            this.dest = d;
+        }
+    }
+
+    public static void createGraph(ArrayList<Edge> graph[]) {
+        for (int i = 0; i < graph.length; i++) {
+            graph[i] = new ArrayList<Edge>();
+        }
+        graph[0].add(new Edge(0, 1));
+        graph[0].add(new Edge(0, 2));
+
+        graph[1].add(new Edge(1, 0));
+        graph[1].add(new Edge(1, 3));
+
+        graph[2].add(new Edge(2, 0));
+        graph[2].add(new Edge(2, 4));
+
+        graph[3].add(new Edge(3, 1));
+        graph[3].add(new Edge(3, 4));
+        graph[3].add(new Edge(3, 5));
+
+        graph[4].add(new Edge(4, 2));
+        graph[4].add(new Edge(4, 3));
+        graph[4].add(new Edge(4, 5));
+
+        graph[5].add(new Edge(5, 3));
+        graph[5].add(new Edge(5, 4));
+        graph[5].add(new Edge(5, 6));
+
+        graph[6].add(new Edge(6, 5));
+
+    }
+
+    public static void depthFirst(ArrayList<Edge> graph[], int curr, boolean vis[]) {
+        System.out.println(curr);
+        vis[curr] = true;
+        for (int i = 0; i < graph[curr].size(); i++) {
+            Edge e = graph[curr].get(i);
+            if (vis[e.dest] == false) {
+                depthFirst(graph, e.dest, vis);
+            }
+        }
+
+    }
+
+}