Commit 81f845f

mo khan <mo.khan@gmail.com>
2020-09-08 00:55:03
test: add test to check if vertices are connected
1 parent 373fbfd
Changed files (3)
src/03/graph.c
@@ -24,3 +24,7 @@ Vertex *graph_add_vertex(Graph *graph, char label) {
 void graph_add_edge(Graph *graph, Vertex *a, Vertex *b) {
   graph->edges[a->label][b->label] = true;
 }
+
+bool graph_connected(Graph *graph, Vertex *a, Vertex *b) {
+  return true;
+}
src/03/graph.h
@@ -12,3 +12,4 @@ typedef struct {
 Graph *graph_initialize(void);
 Vertex *graph_add_vertex(Graph *graph, char label);
 void graph_add_edge(Graph *graph, Vertex *a, Vertex *b);
+bool graph_connected(Graph *graph, Vertex *a, Vertex *b);
src/03/graph_test.c
@@ -2,10 +2,6 @@
 #include <cgreen/cgreen.h>
 #include <string.h>
 
-Ensure(three_equals_three) {
-  assert_that(3, is_equal_to(3));
-}
-
 Ensure(initialize_returns_a_new_graph) {
   Graph *graph = graph_initialize();
 
@@ -46,17 +42,24 @@ Ensure(add_edge_connects_two_vertices) {
   assert_that(graph->edges['b']['a'], is_equal_to(false));
 }
 
-TestSuite *graph_tests() {
-  TestSuite *x = create_test_suite();
+Ensure(connected_returns_true) {
+  Graph *graph = graph_initialize();
+  Vertex *a = graph_add_vertex(graph, 'a');
+  Vertex *b = graph_add_vertex(graph, 'b');
 
-  add_test(x, three_equals_three);
+  graph_add_edge(graph, a, b);
 
-  add_test(x, initialize_returns_a_new_graph);
+  assert_that(graph_connected(graph, a, b), is_equal_to(true));
+}
 
-  add_test(x, add_vertex_returns_a_new_vertex);
-  add_test(x, add_vertex_adds_max_number_of_verticies_to_graph);
+TestSuite *graph_tests() {
+  TestSuite *x = create_test_suite();
 
   add_test(x, add_edge_connects_two_vertices);
+  add_test(x, add_vertex_adds_max_number_of_verticies_to_graph);
+  add_test(x, add_vertex_returns_a_new_vertex);
+  add_test(x, connected_returns_true);
+  add_test(x, initialize_returns_a_new_graph);
 
   return x;
 }