Cleaned up the repo

DFS.java → DFS(Java & Python)/DFS.java

@@ -1,52 +1,52 @@
-import java.io.*;
-import java.util.*;
-
-class Graph
-{
-    private int V;   
-    private LinkedList<Integer> adj[];
-
-    Graph(int v)
-    {
-        V = v;
-        adj = new LinkedList[v];
-        for (int i=0; i<v; ++i)
-            adj[i] = new LinkedList();
-    }
-    void addEdge(int v, int w)
-    {
-        adj[v].add(w);  
-    }
- 
-    void DFSUtil(int v,boolean visited[])
-    {
-        visited[v] = true;
-        System.out.print(v+" ");
- 
-        Iterator<Integer> i = adj[v].listIterator();
-        while (i.hasNext())
-        {
-            int n = i.next();
-            if (!visited[n])
-                DFSUtil(n, visited);
-        }
-    }
- 
-    void DFS(int v)
-    {
-        boolean visited[] = new boolean[V];
-        DFSUtil(v, visited);
-    }
- 
-    public static void main(String args[])
-    {
-        Graph g = new Graph(4); 
-        g.addEdge(0, 1);
-        g.addEdge(0, 2);
-        g.addEdge(1, 2);
-        g.addEdge(2, 0);
-        g.addEdge(2, 3);
-        g.addEdge(3, 3); 
-        g.DFS(2);
-    }
+import java.io.*;
+import java.util.*;
+
+class Graph
+{
+    private int V;   
+    private LinkedList<Integer> adj[];
+
+    Graph(int v)
+    {
+        V = v;
+        adj = new LinkedList[v];
+        for (int i=0; i<v; ++i)
+            adj[i] = new LinkedList();
+    }
+    void addEdge(int v, int w)
+    {
+        adj[v].add(w);  
+    }
+
+    void DFSUtil(int v,boolean visited[])
+    {
+        visited[v] = true;
+        System.out.print(v+" ");
+
+        Iterator<Integer> i = adj[v].listIterator();
+        while (i.hasNext())
+        {
+            int n = i.next();
+            if (!visited[n])
+                DFSUtil(n, visited);
+        }
+    }
+
+    void DFS(int v)
+    {
+        boolean visited[] = new boolean[V];
+        DFSUtil(v, visited);
+    }
+
+    public static void main(String args[])
+    {
+        Graph g = new Graph(4); 
+        g.addEdge(0, 1);
+        g.addEdge(0, 2);
+        g.addEdge(1, 2);
+        g.addEdge(2, 0);
+        g.addEdge(2, 3);
+        g.addEdge(3, 3); 
+        g.DFS(2);
+    }
 }

DFS.py → DFS(Java & Python)/DFS.py

@@ -1,52 +1,52 @@
-from collections import defaultdict
-
-class Graph: 
-  def __init__(self):
-        self.graph = defaultdict(list)
-  def insertedge(self,a,b):
-    #adjmatrix = [[None for i in range(0,n)] for i in range(0,n)]
-    a = int(a)
-    b = int(b)
-    self.graph[a].append(b)
-    #print(adjmatrix)
-    #a,b = input().split()
-    #print(a,b)
-    #adjmatrix[a-1][b-1] = 1
-  
-  def printgraph(self):
-    print(self.graph)
-  
-  def dfsshow(self,v):
-    visited = [False]*(max(self.graph.values())[0]+1)
-    #print(len(self.graph),max(self.graph.values()))
-    self.visit(v,visited)
-    
-  def visit(self,v,visited):
-    visited[v] = True
-    print(v,"->",end = " ")
-    for i in self.graph[v]:
-      if visited[i] == False:
-        self.visit(i,visited)
-        
-  def fullsearch(self):
-    startnode = min(self.graph)
-    v = startnode
-    visited = [False]*(max(self.graph.values())[0]+1)
-    #print(len(self.graph),max(self.graph.values()))
-    self.visit(v,visited)
-    v = startnode + 1
-    print("BREAK ->",end = " ")
-    while(visited[v] == False):
-      self.visit(v,visited)
-    #print(visited)
-  
-        
-new = Graph()
-new.insertedge(0,1)
-new.insertedge(0,2)
-new.insertedge(1,2)
-new.insertedge(3,3)
-new.insertedge(2,0)
-new.insertedge(2,3)
-new.fullsearch()
+from collections import defaultdict
+
+class Graph: 
+  def __init__(self):
+        self.graph = defaultdict(list)
+  def insertedge(self,a,b):
+    #adjmatrix = [[None for i in range(0,n)] for i in range(0,n)]
+    a = int(a)
+    b = int(b)
+    self.graph[a].append(b)
+    #print(adjmatrix)
+    #a,b = input().split()
+    #print(a,b)
+    #adjmatrix[a-1][b-1] = 1
+
+  def printgraph(self):
+    print(self.graph)
+
+  def dfsshow(self,v):
+    visited = [False]*(max(self.graph.values())[0]+1)
+    #print(len(self.graph),max(self.graph.values()))
+    self.visit(v,visited)
+
+  def visit(self,v,visited):
+    visited[v] = True
+    print(v,"->",end = " ")
+    for i in self.graph[v]:
+      if visited[i] == False:
+        self.visit(i,visited)
+
+  def fullsearch(self):
+    startnode = min(self.graph)
+    v = startnode
+    visited = [False]*(max(self.graph.values())[0]+1)
+    #print(len(self.graph),max(self.graph.values()))
+    self.visit(v,visited)
+    v = startnode + 1
+    print("BREAK ->",end = " ")
+    while(visited[v] == False):
+      self.visit(v,visited)
+    #print(visited)
+
+
+new = Graph()
+new.insertedge(0,1)
+new.insertedge(0,2)
+new.insertedge(1,2)
+new.insertedge(3,3)
+new.insertedge(2,0)
+new.insertedge(2,3)
+new.fullsearch()
 new.dfsshow(2)

Dijsktra Algo.py → Dijkstra_Shortest_Path_Algo/Dijsktra Algo.py

@@ -1,71 +1,71 @@
-import sys
-from collections import defaultdict
-
-class Graph: 
-  def __init__(self,n):
-        self.vert = n
-        #self.graph = defaultdict(list)
-        self.graph = [[0 for column in range(n)] 
-                      for row in range(n)]
-        self.pathlist = defaultdict(list)
-  def insertedge(self,a,b,dist):
-    a = int(a)
-    b = int(b)
-    #print("bhavin")
-    #self.graph[a].append(b)
-    #print(adjmatrix)
-    #a,b = input().split()
-    #print(a,b)
-    self.graph[a][b] = dist
-    #self.printgraph()
-  
-  def printgraph(self):
-    print(self.graph)
-  
-  def printshortestgraph(self, dist):
-        print("Vertex tDistance from Source")
-        for node in range(self.vert):
-            print("From 0 to ", node ," - >",dist[node],end = " ")
-            print(self.pathlist[node])
-  
-  def findmindist(self,dist,sptSet):
-        #print(dist)
-        minval = sys.maxsize
-        #print(minval)
-        #min_index = 225
-        for v in range(self.vert):
-            if dist[v] < minval and sptSet[v] == False:
-                minval = dist[v]
-                min_index = v
-                #print("assign",v)
-        return min_index
-  
-  def dijkstra(self, src):
-        dist = [sys.maxsize] * self.vert
-        dist[src] = 0
-        self.pathlist[0].append(src)
-        sptSet = [False] * self.vert
-        for cout in range(self.vert):
-            u = self.findmindist(dist, sptSet)
-            #if u == 225 :
-            #  break
-            sptSet[u] = True
-            for v in range(self.vert):
-                if self.graph[u][v] > 0 and sptSet[v] == False and dist[v] > dist[u] + self.graph[u][v]:
-                        dist[v] = dist[u] + self.graph[u][v]
-                        self.pathlist[v] = self.pathlist[u] + [v]
-                        #print(dist,"Changing")
-        #print("bhavin")
-        self.printshortestgraph(dist)
-  
-new = Graph(6)
-new.insertedge(0,1,8)
-new.insertedge(0,2,1)
-new.insertedge(1,2,2)
-new.insertedge(1,3,2)
-new.insertedge(2,4,4)
-new.insertedge(2,3,3)
-new.insertedge(3,4,1)
-new.insertedge(3,5,12)
-new.insertedge(4,5,7)
+import sys
+from collections import defaultdict
+
+class Graph: 
+  def __init__(self,n):
+        self.vert = n
+        #self.graph = defaultdict(list)
+        self.graph = [[0 for column in range(n)] 
+                      for row in range(n)]
+        self.pathlist = defaultdict(list)
+  def insertedge(self,a,b,dist):
+    a = int(a)
+    b = int(b)
+    #print("bhavin")
+    #self.graph[a].append(b)
+    #print(adjmatrix)
+    #a,b = input().split()
+    #print(a,b)
+    self.graph[a][b] = dist
+    #self.printgraph()
+
+  def printgraph(self):
+    print(self.graph)
+
+  def printshortestgraph(self, dist):
+        print("Vertex tDistance from Source")
+        for node in range(self.vert):
+            print("From 0 to ", node ," - >",dist[node],end = " ")
+            print(self.pathlist[node])
+
+  def findmindist(self,dist,sptSet):
+        #print(dist)
+        minval = sys.maxsize
+        #print(minval)
+        #min_index = 225
+        for v in range(self.vert):
+            if dist[v] < minval and sptSet[v] == False:
+                minval = dist[v]
+                min_index = v
+                #print("assign",v)
+        return min_index
+
+  def dijkstra(self, src):
+        dist = [sys.maxsize] * self.vert
+        dist[src] = 0
+        self.pathlist[0].append(src)
+        sptSet = [False] * self.vert
+        for cout in range(self.vert):
+            u = self.findmindist(dist, sptSet)
+            #if u == 225 :
+            #  break
+            sptSet[u] = True
+            for v in range(self.vert):
+                if self.graph[u][v] > 0 and sptSet[v] == False and dist[v] > dist[u] + self.graph[u][v]:
+                        dist[v] = dist[u] + self.graph[u][v]
+                        self.pathlist[v] = self.pathlist[u] + [v]
+                        #print(dist,"Changing")
+        #print("bhavin")
+        self.printshortestgraph(dist)
+
+new = Graph(6)
+new.insertedge(0,1,8)
+new.insertedge(0,2,1)
+new.insertedge(1,2,2)
+new.insertedge(1,3,2)
+new.insertedge(2,4,4)
+new.insertedge(2,3,3)
+new.insertedge(3,4,1)
+new.insertedge(3,5,12)
+new.insertedge(4,5,7)
 new.dijkstra(0)