Some DFS in action.

CMakeLists.txt

@@ -13,3 +13,4 @@ add_subdirectory(priority_queue)
 add_subdirectory(splay_tree)
 add_subdirectory(merge_sort)
 add_subdirectory(quick_sort)
+add_subdirectory(graphs)

graphs/CMakeLists.txt

@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.5)
+project(graphs_proj)
+
+set(SOURCE_FILES main.c graphs.c)
+add_executable(graphs ${SOURCE_FILES})
+

graphs/graphs.c

@@ -0,0 +1,22 @@
+#include "graphs.h"
+
+UndirectedGraph * ugraph_create(int v) {
+  UndirectedGraph * g = malloc(sizeof(UndirectedGraph) + sizeof(struct neighbor *) * v);
+  assert(g);
+
+  g->v = v;
+  g->e = 0;
+
+  for (int i = 0; i < v; ++i) {
+    g->adjacency_list[i] = malloc(sizeof(struct neighbors));
+    assert(g->adjacency_list[i]);
+
+    g->adjacency_list[i]->length = 0;
+  }
+
+  return g;
+}
+
+void ugraph_destroy(UndirectedGraph* g) {
+
+}

graphs/graphs.h

@@ -0,0 +1,22 @@
+#include <assert.h>
+#include <stdlib.h>
+
+#ifndef PROJECT_GRAPHS_H
+#define PROJECT_GRAPHS_H
+
+typedef struct {
+  int v; /* vertex count */
+  int e; /* edge count */
+
+  struct neighbors {
+    int length;
+    int list[];
+  } * adjacency_list[];
+
+} UndirectedGraph;
+
+UndirectedGraph* ugraph_create(int v);
+
+void ugraph_destroy(UndirectedGraph* g);
+
+#endif  // PROJECT_GRAPHS_H

graphs/main.c

@@ -0,0 +1,8 @@
+#include <stdio.h>
+#include "graphs.h"
+
+int main(int argc, char* argv[]) {
+  printf("Hello\n");
+
+  return 0;
+}

valgrind.sh

@@ -0,0 +1,9 @@
+#!/usr/bin/env bash
+
+if [ $1 = "C" ]
+then
+    /usr/bin/clang -ggdb main.c -std=c99 -Wall -Werror -o program && /usr/local/bin/valgrind ./program
+elif [ $1 = "Cpp" ]
+then
+    /usr/bin/clang++ -std=c++11 -stdlib=libc++ main.cc -Wall -Werror -o program && /usr/local/bin/valgrind ./program
+fi