From b81527ea43634496b72e5dbdd7f830eb249772bb Mon Sep 17 00:00:00 2001
From: Sajal193 <74758269+Sajal193@users.noreply.github.com>
Date: Thu, 21 Oct 2021 03:56:34 +0530
Subject: [PATCH 1/2] Added new folder labeled Graph Algorithms

---
 Graph Algorithms | 1 +
 1 file changed, 1 insertion(+)
 create mode 160000 Graph Algorithms

diff --git a/Graph Algorithms b/Graph Algorithms
new file mode 160000
index 0000000..925447e
--- /dev/null
+++ b/Graph Algorithms	
@@ -0,0 +1 @@
+Subproject commit 925447eb14eab16e1a1a489723b17e287280a4e2

From e60a9866b66b2087100e4b4851efbe516859a8b8 Mon Sep 17 00:00:00 2001
From: Sajal193 <74758269+Sajal193@users.noreply.github.com>
Date: Thu, 21 Oct 2021 04:08:15 +0530
Subject: [PATCH 2/2] Djikstra's algorithm for adjacency list representation in
 C++

---
 ...thm_for_Adjacency_List_Representation.cpp" | 316 ++++++++++++++++++
 Graph Algorithms                              |   1 -
 2 files changed, 316 insertions(+), 1 deletion(-)
 create mode 100644 "Algorithm Collections/Dijkstra\342\200\231s_Algorithm_for_Adjacency_List_Representation.cpp"
 delete mode 160000 Graph Algorithms

diff --git "a/Algorithm Collections/Dijkstra\342\200\231s_Algorithm_for_Adjacency_List_Representation.cpp" "b/Algorithm Collections/Dijkstra\342\200\231s_Algorithm_for_Adjacency_List_Representation.cpp"
new file mode 100644
index 0000000..d944bc3
--- /dev/null
+++ "b/Algorithm Collections/Dijkstra\342\200\231s_Algorithm_for_Adjacency_List_Representation.cpp"	
@@ -0,0 +1,316 @@
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <limits.h>
+ 
+
+struct AdjListNode
+{
+    int dest;
+    int weight;
+    struct AdjListNode* next;
+};
+ 
+
+struct AdjList
+{
+     
+   struct AdjListNode *head;
+};
+ 
+
+struct Graph
+{
+    int V;
+    struct AdjList* array;
+};
+
+struct AdjListNode* newAdjListNode(
+                   int dest, int weight)
+{
+    struct AdjListNode* newNode =
+            (struct AdjListNode*)
+      malloc(sizeof(struct AdjListNode));
+    newNode->dest = dest;
+    newNode->weight = weight;
+    newNode->next = NULL;
+    return newNode;
+}
+
+struct Graph* createGraph(int V)
+{
+    struct Graph* graph = (struct Graph*)
+            malloc(sizeof(struct Graph));
+    graph->V = V;
+ 
+    graph->array = (struct AdjList*)
+       malloc(V * sizeof(struct AdjList));
+ 
+    for (int i = 0; i < V; ++i)
+        graph->array[i].head = NULL;
+ 
+    return graph;
+}
+
+void addEdge(struct Graph* graph, int src,
+                   int dest, int weight)
+{
+   
+    struct AdjListNode* newNode =
+            newAdjListNode(dest, weight);
+    newNode->next = graph->array[src].head;
+    graph->array[src].head = newNode;
+ 
+    newNode = newAdjListNode(src, weight);
+    newNode->next = graph->array[dest].head;
+    graph->array[dest].head = newNode;
+}
+ 
+
+struct MinHeapNode
+{
+    int  v;
+    int dist;
+};
+ 
+struct MinHeap
+{
+     
+    
+    int size;    
+   
+    int capacity; 
+   
+    
+    int *pos;   
+    struct MinHeapNode **array;
+};
+
+struct MinHeapNode* newMinHeapNode(int v,
+                                 int dist)
+{
+    struct MinHeapNode* minHeapNode =
+           (struct MinHeapNode*)
+      malloc(sizeof(struct MinHeapNode));
+    minHeapNode->v = v;
+    minHeapNode->dist = dist;
+    return minHeapNode;
+}
+
+struct MinHeap* createMinHeap(int capacity)
+{
+    struct MinHeap* minHeap =
+         (struct MinHeap*)
+      malloc(sizeof(struct MinHeap));
+    minHeap->pos = (int *)malloc(
+            capacity * sizeof(int));
+    minHeap->size = 0;
+    minHeap->capacity = capacity;
+    minHeap->array =
+         (struct MinHeapNode**)
+                 malloc(capacity *
+       sizeof(struct MinHeapNode*));
+    return minHeap;
+}
+
+void swapMinHeapNode(struct MinHeapNode** a,
+                     struct MinHeapNode** b)
+{
+    struct MinHeapNode* t = *a;
+    *a = *b;
+    *b = t;
+}
+
+void minHeapify(struct MinHeap* minHeap,
+                                  int idx)
+{
+    int smallest, left, right;
+    smallest = idx;
+    left = 2 * idx + 1;
+    right = 2 * idx + 2;
+ 
+    if (left < minHeap->size &&
+        minHeap->array[left]->dist <
+         minHeap->array[smallest]->dist )
+      smallest = left;
+ 
+    if (right < minHeap->size &&
+        minHeap->array[right]->dist <
+         minHeap->array[smallest]->dist )
+      smallest = right;
+ 
+    if (smallest != idx)
+    {
+        MinHeapNode *smallestNode =
+             minHeap->array[smallest];
+        MinHeapNode *idxNode =
+                 minHeap->array[idx];
+ 
+        
+        minHeap->pos[smallestNode->v] = idx;
+        minHeap->pos[idxNode->v] = smallest;
+ 
+        swapMinHeapNode(&minHeap->array[smallest],
+                         &minHeap->array[idx]);
+ 
+        minHeapify(minHeap, smallest);
+    }
+}
+
+int isEmpty(struct MinHeap* minHeap)
+{
+    return minHeap->size == 0;
+}
+
+struct MinHeapNode* extractMin(struct MinHeap*
+                                   minHeap)
+{
+    if (isEmpty(minHeap))
+        return NULL;
+ 
+    struct MinHeapNode* root =
+                   minHeap->array[0];
+ 
+    struct MinHeapNode* lastNode =
+         minHeap->array[minHeap->size - 1];
+    minHeap->array[0] = lastNode;
+ 
+    minHeap->pos[root->v] = minHeap->size-1;
+    minHeap->pos[lastNode->v] = 0;
+ 
+   
+    --minHeap->size;
+    minHeapify(minHeap, 0);
+ 
+    return root;
+}
+ 
+
+void decreaseKey(struct MinHeap* minHeap,
+                         int v, int dist)
+{
+    
+    int i = minHeap->pos[v];
+ 
+    
+    minHeap->array[i]->dist = dist;
+ 
+    while (i && minHeap->array[i]->dist <
+           minHeap->array[(i - 1) / 2]->dist)
+    {
+        minHeap->pos[minHeap->array[i]->v] =
+                                      (i-1)/2;
+        minHeap->pos[minHeap->array[
+                             (i-1)/2]->v] = i;
+        swapMinHeapNode(&minHeap->array[i], 
+                 &minHeap->array[(i - 1) / 2]);
+ 
+        
+        i = (i - 1) / 2;
+    }
+}
+ 
+bool isInMinHeap(struct MinHeap *minHeap, int v)
+{
+   if (minHeap->pos[v] < minHeap->size)
+     return true;
+   return false;
+}
+ 
+void printArr(int dist[], int n)
+{
+    printf("Vertex   Distance from Source\n");
+    for (int i = 0; i < n; ++i)
+        printf("%d \t\t %d\n", i, dist[i]);
+}
+ 
+
+void dijkstra(struct Graph* graph, int src)
+{
+     
+    
+    int V = graph->V;
+   
+    
+    int dist[V];    
+ 
+    
+    struct MinHeap* minHeap = createMinHeap(V);
+ 
+   
+    for (int v = 0; v < V; ++v)
+    {
+        dist[v] = INT_MAX;
+        minHeap->array[v] = newMinHeapNode(v,
+                                      dist[v]);
+        minHeap->pos[v] = v;
+    }
+ 
+    minHeap->array[src] =
+          newMinHeapNode(src, dist[src]);
+    minHeap->pos[src]   = src;
+    dist[src] = 0;
+    decreaseKey(minHeap, src, dist[src]);
+ 
+    
+    minHeap->size = V;
+ 
+   
+    while (!isEmpty(minHeap))
+    {
+       
+        struct MinHeapNode* minHeapNode =
+                     extractMin(minHeap);
+       
+        
+        int u = minHeapNode->v;
+ 
+        
+        struct AdjListNode* pCrawl =
+                     graph->array[u].head;
+        while (pCrawl != NULL)
+        {
+            int v = pCrawl->dest;
+ 
+           
+            if (isInMinHeap(minHeap, v) &&
+                      dist[u] != INT_MAX &&
+              pCrawl->weight + dist[u] < dist[v])
+            {
+                dist[v] = dist[u] + pCrawl->weight;
+
+                decreaseKey(minHeap, v, dist[v]);
+            }
+            pCrawl = pCrawl->next;
+        }
+    }
+ 
+    printArr(dist, V);
+}
+ 
+ 
+
+int main()
+{
+    
+    int V = 9;
+    struct Graph* graph = createGraph(V);
+    addEdge(graph, 0, 1, 4);
+    addEdge(graph, 0, 7, 8);
+    addEdge(graph, 1, 2, 8);
+    addEdge(graph, 1, 7, 11);
+    addEdge(graph, 2, 3, 7);
+    addEdge(graph, 2, 8, 2);
+    addEdge(graph, 2, 5, 4);
+    addEdge(graph, 3, 4, 9);
+    addEdge(graph, 3, 5, 14);
+    addEdge(graph, 4, 5, 10);
+    addEdge(graph, 5, 6, 2);
+    addEdge(graph, 6, 7, 1);
+    addEdge(graph, 6, 8, 6);
+    addEdge(graph, 7, 8, 7);
+ 
+    dijkstra(graph, 0);
+ 
+    return 0;
+}
\ No newline at end of file
diff --git a/Graph Algorithms b/Graph Algorithms
deleted file mode 160000
index 925447e..0000000
--- a/Graph Algorithms	
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 925447eb14eab16e1a1a489723b17e287280a4e2