updated the size of the queue

Author: SravanthiSinha

0x06-graphs/graphs.h

@@ -10,7 +10,7 @@
 #define  UNEXPLORED 0
 #define  EXPLORED 1
 #define BACKTRACK 2
-#define SIZE INT_MAX
+#define SIZE 65536
 #define LEVELBREAK -60
 /**
  * enum edge_type_e - Enumerates the different types of

0x06-graphs/tests/graphs.h

@@ -10,7 +10,7 @@
 #define  UNEXPLORED 0
 #define  EXPLORED 1
 #define BACKTRACK 2
-#define SIZE INT_MAX
+#define SIZE 65536
 #define LEVELBREAK -60
 /**
  * enum edge_type_e - Enumerates the different types of

0x06-graphs/tests/main_0.c

@@ -57,7 +57,6 @@ int main(void)
 			}
 		}
 	}
-  graph_display(graph);
 	depth = breadth_first_traverse(graph, &traverse_action);
 	printf("\nDepth: %lu\n", depth);
 

0x06-graphs/tests/main_2.c

@@ -0,0 +1,45 @@
+/* Description: Traverse a graph with no vertex, and no edge */
+
+#include <stdlib.h>
+#include <stdio.h>
+
+#include "graphs.h"
+#include "_names.h"
+#include "_edges.h"
+
+/**
+ * traverse_action - Action to be executed for each visited vertex
+ * during traversal
+ *
+ * @v: Pointer to the visited vertex
+ * @depth: Depth of the vertex in graph from vertex 0
+ */
+void traverse_action(const vertex_t *v, size_t depth)
+{
+	printf("(%lu) [%lu] %s\n", depth, v->index, v->content);
+}
+
+/**
+ * main - Entry point
+ *
+ * Return: EXIT_SUCCESS or EXIT_FAILURE
+ */
+int main(void)
+{
+	graph_t *graph;
+	size_t depth;
+
+	graph = graph_create();
+	if (!graph)
+	{
+		printf("Failed to create graph\n");
+		return (EXIT_FAILURE);
+	}
+
+	depth = breadth_first_traverse(graph, &traverse_action);
+	printf("\nDepth: %lu\n", depth);
+
+	graph_delete(graph);
+
+	return (EXIT_SUCCESS);
+}

0x06-graphs/tests/main_3.c

@@ -0,0 +1,33 @@
+/* Description: `depth_first_traverse(graph, NULL);` */
+
+#include <stdlib.h>
+#include <stdio.h>
+
+#include "graphs.h"
+#include "_names.h"
+#include "_edges.h"
+
+/**
+ * main - Entry point
+ *
+ * Return: EXIT_SUCCESS or EXIT_FAILURE
+ */
+int main(void)
+{
+	graph_t *graph;
+	size_t depth;
+
+	graph = graph_create();
+	if (!graph)
+	{
+		printf("Failed to create graph\n");
+		return (EXIT_FAILURE);
+	}
+
+	depth = breadth_first_traverse(graph, NULL);
+	printf("\nDepth: %lu\n", depth);
+
+	graph_delete(graph);
+
+	return (EXIT_SUCCESS);
+}

0x06-graphs/tests/main_4.c

@@ -0,0 +1,35 @@
+/* Description: `depth_first_traverse(NULL, &traverse_action);` */
+
+#include <stdlib.h>
+#include <stdio.h>
+
+#include "graphs.h"
+#include "_names.h"
+#include "_edges.h"
+
+/**
+ * traverse_action - Action to be executed for each visited vertex
+ * during traversal
+ *
+ * @v: Pointer to the visited vertex
+ * @depth: Depth of the vertex in graph from vertex 0
+ */
+void traverse_action(const vertex_t *v, size_t depth)
+{
+	printf("(%lu) [%lu] %s\n", depth, v->index, v->content);
+}
+
+/**
+ * main - Entry point
+ *
+ * Return: EXIT_SUCCESS or EXIT_FAILURE
+ */
+int main(void)
+{
+	size_t depth;
+
+	depth = breadth_first_traverse(NULL, &traverse_action);
+	printf("\nDepth: %lu\n", depth);
+
+	return (EXIT_SUCCESS);
+}