adjacency matrix graph (#57)

Author: realDuYuanChao

CMakeLists.txt

@@ -9,6 +9,7 @@ add_subdirectory(ciphers)
 add_subdirectory(conversions)
 add_subdirectory(datastructures/array)
 add_subdirectory(datastructures/binarytree)
+add_subdirectory(datastructures/graph)
 add_subdirectory(datastructures/hash)
 add_subdirectory(datastructures/stack)
 add_subdirectory(datastructures/tree)

datastructures/graph/CMakeLists.txt

@@ -0,0 +1,13 @@
+# If necessary, use the RELATIVE flag, otherwise each source file may be listed
+# with full pathname. RELATIVE may makes it easier to extract an executable name
+# automatically.
+file( GLOB APP_SOURCES RELATIVE ${CMAKE_CURRENT_SOURCE_DIR} *.c )
+# file( GLOB APP_SOURCES ${CMAKE_SOURCE_DIR}/*.c )
+# AUX_SOURCE_DIRECTORY(${CMAKE_CURRENT_SOURCE_DIR} APP_SOURCES)
+foreach( testsourcefile ${APP_SOURCES} )
+    # I used a simple string replace, to cut off .cpp.
+    string( REPLACE ".c" "" testname ${testsourcefile} )
+    add_executable( ${testname} ${testsourcefile} )
+    install(TARGETS ${testname} DESTINATION "bin/graph")
+
+endforeach( testsourcefile ${APP_SOURCES} )

datastructures/graph/graph_adjacency_matrix.c

@@ -0,0 +1,85 @@
+#include <assert.h>
+#define VERTEX_NUM 5
+typedef char ElemType;
+typedef struct {
+    ElemType vertex[VERTEX_NUM];
+    int edge[VERTEX_NUM][VERTEX_NUM];
+}Graph;
+
+void initVertex(Graph *graph) {
+    for (int i = 0; i < VERTEX_NUM; ++i) {
+        graph->vertex[i] = '\0';
+    }
+}
+
+void initEdge(Graph *graph)  {
+    for (int i = 0; i < VERTEX_NUM; ++i) {
+        for (int j = 0; j < VERTEX_NUM; ++j) {
+            graph->edge[i][j] = 0;
+        }
+    }
+}
+
+void initGraph(Graph *graph) {
+    initVertex(graph);
+    initEdge(graph);
+}
+
+/**
+ * Insert vertexes graph with example vertexes, see images/adjacency_matrix_graph.jpeg
+ * @param graph the graph store vertexes.
+ */
+void insertVertex(Graph *graph) {
+    for (int i = 0; i < VERTEX_NUM; ++i) {
+        graph->vertex[i] = 'A' + i;
+    }
+}
+
+/**
+ * Insert edges with example graph. See images/adjacency_matrix_graph.jpeg
+ * @param graph graph the graph store edges.
+ */
+void insertEdge(Graph *graph) {
+    int matrix[VERTEX_NUM][VERTEX_NUM] = {
+            {0, 1, 1, 1, 0},
+            {1, 0, 0, 1, 1},
+            {1, 0, 0, 1, 0},
+            {1, 1, 1, 1, 1},
+            {0, 1, 0, 1, 0}
+    };
+    for (int i = 0; i < VERTEX_NUM; ++i) {
+        for (int j = 0; j < VERTEX_NUM; ++j) {
+            graph->edge[i][j] = matrix[i][j];
+        }
+    }
+}
+
+void test() {
+    Graph graph;
+    initGraph(&graph);
+    insertVertex(&graph);
+    insertEdge(&graph);
+
+    for (int i = 0; i < VERTEX_NUM; ++i) {
+        assert(graph.vertex[i] == 'A' + i);
+    }
+
+    int matrix[VERTEX_NUM][VERTEX_NUM] = {
+            {0, 1, 1, 1, 0},
+            {1, 0, 0, 1, 1},
+            {1, 0, 0, 1, 0},
+            {1, 1, 1, 1, 1},
+            {0, 1, 0, 1, 0}
+    };
+    for (int i = 0; i < VERTEX_NUM; ++i) {
+        for (int j = 0; j < VERTEX_NUM; ++j) {
+            assert(graph.edge[i][j] == matrix[i][j]);
+        }
+    }
+}
+
+int main() {
+    test();
+    return 0;
+}
+