Add noOfWays and combineHeaps.

Author: manosriram

Graphs/a.out

@@ -21,19 +21,13 @@ int findWays(vector<int> grph[], bool visited[], int src, int dest)
         qt.pop();
 
         if (root == dest)
-        {
-            visited[root] = true;
             continue;
-        }
         else
         {
             for (auto i = grph[root].begin(); i != grph[root].end(); i++)
             {
                 if (*i == dest)
-                {
                     ways++;
-                    pathCount++;
-                }
 
                 if (!visited[*i])
                 {

Graphs/noOfWays.cpp

@@ -46,33 +46,37 @@ void buildHeap(Heap *heap, int n)
 int extractMax(Heap *&heap)
 {
     int root = heap->heapArr[1];
-    
+
     swap(heap->heapArr[1], heap->heapArr[heap->currentHeapSize]);
-    
+
     heap->currentHeapSize--;
 
     heapifyDown(heap, 1, heap->currentHeapSize);
     return root;
 }
 
-void printHeap(Heap *heap, int n) {
-    for (int t=1;t<=n;t++)
+void printHeap(Heap *heap, int n)
+{
+    for (int t = 1; t <= n; t++)
         cout << heap->heapArr[t] << " ";
-    
+
     cout << endl;
     return;
 }
 
-void heapSort(Heap *heap) {
+void heapSort(Heap *heap)
+{
     int n = heap->currentHeapSize;
-    for (int t = 1;t<=n;t++) {
+    for (int t = 1; t <= n; t++)
+    {
         extractMax(heap);
     }
     printHeap(heap, n);
     return;
 }
 
-Heap *initHeap() {
+Heap *initHeap()
+{
     Heap *heap = new Heap();
     heap->currentHeapSize = 0;
     heap->maxHeapSize = 64;

Heaps/MaxHeap.h

@@ -0,0 +1,53 @@
+#include <iostream>
+#include "MaxHeap.h"
+using namespace std;
+
+void printHeap(Heap *hp)
+{
+    cout << endl;
+    for (int t = 1; t < (hp->currentHeapSize / 2) + 1; t++)
+    {
+        cout << hp->heapArr[t] << " -> ";
+        cout << " Left Child  : ";
+        cout << hp->heapArr[(2 * t)] << '\t';
+
+        cout << " Right Child  : ";
+        cout << hp->heapArr[(2 * t) + 1] << '\t';
+        cout << endl;
+    }
+    cout << endl;
+    return;
+}
+
+void combineHeaps(Heap *h1, Heap *h2)
+{
+    int n = h2->currentHeapSize;
+    for (int t=1;t<=n;t++)
+    {
+        insert(h1, h2->heapArr[t]);
+    }
+    buildHeap(h1, h1->currentHeapSize);
+    return;
+}
+
+int main()
+{
+    Heap *h1 = initHeap();
+    Heap *h2 = initHeap();
+
+    insert(h1, 50);
+    insert(h1, 40);
+    insert(h1, 30);
+    insert(h1, 20);
+    insert(h1, 31);
+    insert(h1, 25);
+
+    insert(h2, 100);
+    insert(h2, 56);
+    insert(h2, 80);
+    insert(h2, 4);
+
+    printHeap(h1);
+    combineHeaps(h1, h2);
+    printHeap(h1);
+}