diff --git a/Java/algorithms/DepthFirstSearch.java b/Java/algorithms/DepthFirstSearch.java
new file mode 100644
index 0000000..50ef241
--- /dev/null
+++ b/Java/algorithms/DepthFirstSearch.java
@@ -0,0 +1,49 @@
+public class DepthFirstSearch {
+    private boolean[] marked;   
+    private int count;
+    public DepthFirstSearch(Graph G, int s) {
+        marked = new boolean[G.V()];
+        validateVertex(s);
+        dfs(G, s);
+    }
+    private void dfs(Graph G, int v) {
+        count++;
+        marked[v] = true;
+        for (int w : G.adj(v)) {
+            if (!marked[w]) {
+                dfs(G, w);
+            }
+        }
+    }
+    public boolean marked(int v) {
+        validateVertex(v);
+        return marked[v];
+    }
+
+    public int count() {
+        return count;
+    }
+
+    private void validateVertex(int v) {
+        int V = marked.length;
+        if (v < 0 || v >= V)
+            throw new IllegalArgumentException("vertex " + v + " is not between 0 and " + (V-1));
+            
+    public static void main(String[] args) {
+        In in = new In(args[0]);
+        Graph G = new Graph(in);
+        int s = Integer.parseInt(args[1]);
+        DepthFirstSearch search = new DepthFirstSearch(G, s);
+        for (int v = 0; v < G.V(); v++) {
+            if (search.marked(v))
+                StdOut.print(v + " ");
+        }
+
+        StdOut.println();
+        if (search.count() != G.V())
+        StdOut.println("NOT connected");
+        else                        
+        StdOut.println("connected");
+    }
+
+}