Create directed graph implementation

directed graph implementation

@@ -0,0 +1,60 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define N 6
+struct Graph
+{
+    struct Node* head[N];
+};
+struct Node
+{
+    int dest;
+    struct Node* next;
+};
+struct Edge {
+    int src, dest;
+};
+struct Graph* createGraph(struct Edge edges[], int n)
+{
+    struct Graph* graph = (struct Graph*)malloc(sizeof(struct Graph));
+    for (int i = 0; i < N; i++) {
+        graph->head[i] = NULL;
+    }
+    for (int i = 0; i < n; i++)
+    {
+        int src = edges[i].src;
+        int dest = edges[i].dest;
+        struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
+        newNode->dest = dest;
+        newNode->next = graph->head[src];
+        graph->head[src] = newNode;
+    }
+
+    return graph;
+}
+void printGraph(struct Graph* graph)
+{
+    for (int i = 0; i < N; i++)
+    {
+        struct Node* ptr = graph->head[i];
+        while (ptr != NULL)
+        {
+            printf("(%d —> %d)\t", i, ptr->dest);
+            ptr = ptr->next;
+        }
+
+        printf("\n");
+    }
+}
+
+int main void()
+{
+    struct Edge edges[] =
+    {
+        {0, 1}, {1, 2}, {2, 0}, {2, 1}, {3, 2}, {4, 5}, {5, 4}
+    };
+    int n = sizeof(edges)/sizeof(edges[0]);
+    struct Graph *graph = createGraph(edges, n);
+    printGraph(graph);
+
+    return 0;
+}