Merge branch 'master' into patch-1

Author: Bhrigu Kansra

Graph/Kruskal's Algorithm

@@ -0,0 +1,82 @@
+#include <iostream>
+#include<bits/stdc++.h>
+using namespace std;
+class edge{
+  public : 
+  int source;
+  int destination;
+  int weight;
+};
+
+bool compare(edge e1, edge e2)
+{
+  return e1.weight < e2.weight;
+}
+
+int findParent(int v, int* parent)
+{
+  if(parent[v] == v)
+    return v;
+  
+  return findParent(parent[v],parent);
+}
+
+void kruskals(edge* input, int V, int E)
+{  
+   sort(input,input+E,compare);
+  
+   edge* output = new edge[V-1];
+   int *parent = new int[V];
+  
+ for(int i = 0; i < V; i++)
+   parent[i] = i;
+  
+  int count = 0;  
+  int i = 0;
+  
+  while(count < V-1)
+  {
+    int srcParent = findParent(input[i].source,parent);
+    int destParent = findParent(input[i].destination,parent);
+    if(srcParent != destParent)
+    {
+      output[count++] = input[i];
+      parent[srcParent] = destParent; 
+    }
+    i++;
+  }
+ 
+ for(int i = 0; i < V-1; i++)
+ {
+   if(output[i].source < output[i].destination)
+     cout<<output[i].source<<" "<<output[i].destination<<" "<<output[i].weight<<endl;
+   else
+     cout<<output[i].destination<<" "<<output[i].source<<" "<<output[i].weight<<endl;
+
+ }
+}
+
+
+int main()
+{
+  int V, E,s,d,w;
+  cin >> V >> E;
+  /*   Write Your Code Here
+	   Complete the Rest of the Program
+	   You have to Print the output yourself 
+  */
+  edge* input = new edge[E];
+  for(int i = 0; i<E; i++)
+  {
+    cin>>s>>d>>w;
+    input[i].source = s;
+    input[i].destination = d;
+    input[i].weight = w;
+  }
+  
+ 
+  
+  kruskals(input,V,E);
+
+  return 0;
+}

Graph/Prim's Algorithm

@@ -0,0 +1,101 @@
+#include <iostream>
+#include<bits/stdc++.h>
+using namespace std;
+int findMinVertex(int* weights, bool* visited, int V)
+{
+  int minVertex = -1;
+  for(int i = 0; i < V; i++)
+  {
+    if(visited[i] == false)
+    {
+      if(minVertex == -1 || weights[i] < weights[minVertex])
+        minVertex = i;
+    }
+  }
+  return minVertex;
+  
+}
+void prim(int** adjMatrix, int V)
+{
+  bool* visited = new bool[V]; 
+  int*  parents = new int[V];
+  int*  weights = new int[V];
+  
+  for(int i = 0; i < V; i++){
+    weights[i] = INT_MAX;
+    visited[i] = false;
+  }
+  
+  parents[0] = -1; 
+  weights[0] = 0;
+  
+      for(int i = 0; i < V - 1; i++)
+      { //find minVertex
+        int minVertex = findMinVertex(weights,visited,V);
+        visited[minVertex] = true;
+        //explore unvisited neighbours
+        for(int j = 0; j < V; j++)
+        {
+          if(adjMatrix[minVertex][j] != 0 && !visited[j])
+          {
+            if(adjMatrix[minVertex][j] < weights[j])
+            {
+              weights[j] = adjMatrix[minVertex][j];
+              parents[j] = minVertex;
+            }        
+          }
+        }
+      }
+  
+  
+  //printing
+  for(int i = 1; i < V; i++)
+  {
+    if(parents[i] < i)
+      cout << parents[i] << " " << i << " " << weights[i] << endl;
+    else
+      cout << i << " " << parents[i] << " " << weights[i] << endl;
+
+  }
+    
+ 
+  
+  
+ }
+int main()
+{
+  int V, E, tempX, tempY;
+  cin >> V >> E;
+
+  /*
+
+  	   Write Your Code Here
+	   Complete the Rest of the Program
+	   You have to Print the output yourself
+	 
+  */
+   int ** adjMatrix = new int*[V];
+    for(int i = 0; i < V; i++)
+    {
+      adjMatrix[i] = new int[V];
+      for(int j = 0; j < V; j++)
+        adjMatrix[i][j] = 0;
+    }
+
+  
+  for(int i = 0; i<E; i++)
+  {int s,d,w;
+    cin>>s>>d>>w;
+    adjMatrix[s][d] = w;
+    adjMatrix[d][s] = w;   
+  }
+
+   prim(adjMatrix,V);
+  
+  for(int i = 0; i < V; i++)
+    delete [] adjMatrix[i];
+  
+  delete [] adjMatrix;
+
+  return 0;
+}

Prim's MST algorithm

@@ -0,0 +1,85 @@
+
+#include <stdio.h> 
+#include <limits.h> 
+#include<stdbool.h> 
+
+#define V 5 
+  
+int minKey(int key[], bool mstSet[]) 
+{ 
+
+int min = INT_MAX, min_index; 
+  
+for (int v = 0; v < V; v++) 
+    if (mstSet[v] == false && key[v] < min) 
+        min = key[v], min_index = v; 
+  
+return min_index; 
+} 
+  
+
+int printMST(int parent[], int n, int graph[V][V]) 
+{ 
+printf("Edge \tWeight\n"); 
+for (int i = 1; i < V; i++) 
+    printf("%d - %d \t%d \n", parent[i], i, graph[i][parent[i]]); 
+} 
+ 
+void primMST(int graph[V][V]) 
+{ 
+   
+    int parent[V];  
+   
+    int key[V];  
+ 
+    bool mstSet[V];  
+  
+    for (int i = 0; i < V; i++) 
+        key[i] = INT_MAX, mstSet[i] = false; 
+  
+  
+    key[0] = 0;      
+    parent[0] = -1; // First node is always root of MST  
+  
+  
+    for (int count = 0; count < V-1; count++) 
+    { 
+         
+        int u = minKey(key, mstSet); 
+  
+       
+        mstSet[u] = true; 
+  
+        for (int v = 0; v < V; v++)
+        
+        if (graph[u][v] && mstSet[v] == false && graph[u][v] < key[v]) 
+            parent[v] = u, key[v] = graph[u][v]; 
+    } 
+  
+    
+    printMST(parent, V, graph); 
+} 
+  
+  
+ 
+int main() 
+{ 
+/* Let us create the following graph 
+        2 3 
+    (0)--(1)--(2) 
+    | / \ | 
+    6| 8/ \5 |7 
+    | /     \ | 
+    (3)-------(4) 
+            9         */
+int graph[V][V] = {{0, 2, 0, 6, 0}, 
+                    {2, 0, 3, 8, 5}, 
+                    {0, 3, 0, 0, 7}, 
+                    {6, 8, 0, 0, 9}, 
+                    {0, 5, 7, 9, 0}}; 
+  
+  
+    primMST(graph); 
+  
+    return 0; 
+} 

Tower Of Hanoi/Tower_Of_Hanoi.java

@@ -0,0 +1,25 @@
+import java.util.Scanner;
+
+public class Tower_Of_Hanoi {
+
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		int nod = sc.nextInt();
+		int count = towerOfHanoiSteps("Ring on 1", "Ring on 2", "Ring on 3", nod,0);
+		 System.out.println("No. of Steps : " + count);
+		sc.close();
+	}
+
+	private static int towerOfHanoiSteps(String p1, String p2, String p3, int no_of_discs,int count) {
+		if (no_of_discs == 1) {
+			System.out.println(p1 + " goes to " + p3);
+			count++;
+		} else {
+			count = towerOfHanoiSteps(p1, p3, p2, no_of_discs - 1,count);
+			System.out.println(p1 + " goes to " + p3);
+			count++;
+			count = towerOfHanoiSteps(p2, p1, p3, no_of_discs - 1,count);
+		}
+		return count;
+	}
+}