DFS Added

Author: soumyadip007

Graph/DFS.ipynb

@@ -2,17 +2,18 @@
  "cells": [
   {
    "cell_type": "code",
-   "execution_count": 21,
+   "execution_count": 7,
    "metadata": {},
    "outputs": [
     {
      "name": "stdout",
      "output_type": "stream",
      "text": [
+      "defaultdict(<class 'list'>, {0: [1, 2], 1: [2], 2: [0, 3], 3: [3]})\n",
       "2  \n",
       "0  \n",
-      "3  \n",
-      "1  \n"
+      "1  \n",
+      "3  \n"
      ]
     }
    ],
@@ -27,23 +28,12 @@
     "    def addEdge(self,u,v):\n",
     "        self.graph[u].append(v)\n",
     "        \n",
-    "    def BFS(self, s):\n",
-    "        \n",
-    "        visited= [False]*len(self.graph)\n",
-    "        queue=[]\n",
-    "        \n",
-    "        queue.append(s)\n",
-    "        visited[s]=True\n",
-    "        \n",
-    "        while queue:\n",
-    "            \n",
-    "            s=queue.pop(0)\n",
-    "            print(s,\" \")\n",
-    "            \n",
-    "            for i in self.graph[s]:\n",
-    "                if visited[i]==False:\n",
-    "                    visited[i]=True\n",
-    "                    queue.append(i)\n",
+    "    def DFS(self, v, visited):\n",
+    "        visited[v]=True\n",
+    "        print(v,\" \")\n",
+    "        for i in self.graph[v]:\n",
+    "            if visited[i]==False:\n",
+    "                self.DFS(i,visited)\n",
     "                    \n",
     "                \n",
     "g = Graph() \n",
@@ -53,8 +43,9 @@
     "g.addEdge(2, 0) \n",
     "g.addEdge(2, 3) \n",
     "g.addEdge(3, 3) \n",
-    "  \n",
-    "g.BFS(2) "
+    "print(g.graph)\n",
+    "visited = [False] * (len(g.graph)) \n",
+    "g.DFS(2,visited) "
    ]
   }
  ],