add graph_is_adjacent

graph/graph_is_adjacent.c

@@ -0,0 +1,13 @@
+#include "graph.h"
+
+int graph_is_adjacent(const Graph *graph, const void *data1, const void *data2) {
+  ListElm *element;
+  for (element = list_head(&graph->adjlists); element != NULL; element = list_next(element)) {
+    if (graph->match(data1, ((AdjList *)list_data(element))->vertex))
+      break;
+  }
+  if (element == NULL)
+    return 0;
+
+  return set_is_member(&((AdjList *)list_data(element))->adjacent, data2);
+}

graph/main.c

@@ -39,6 +39,10 @@ int main (int argc, char **argv) {
                                                   testGraph1->ecount == 1 &&
                                                   *(int *)testPtr2 == 2);
 
+  testPtr2 = &testData2;
+  printf("'graph_is_adjacent' is pass ? %d \n", graph_is_adjacent(testGraph1, testPtr1, testPtr2));
+
+
 
   testPtr2 = &testData2;
   graph_remove_edge(testGraph1, testPtr1, &testPtr2);

graph/makefile

@@ -18,7 +18,14 @@ setObjects = ../set/set_init.o \
 						 ../set/set_remove.o \
 						 ../set/set_union.o
 
-graphObjects = main.o graph_init.o graph_destory.o graph_insert_vertex.o graph_insert_edge.o graph_remove_vertex.o graph_remove_edge.o
+graphObjects = main.o \
+               graph_init.o \
+							 graph_destory.o \
+							 graph_insert_vertex.o \
+							 graph_insert_edge.o \
+							 graph_remove_vertex.o \
+							 graph_remove_edge.o \
+							 graph_is_adjacent.o
 
 objects =  $(listsObjects) $(setObjects) $(graphObjects)