Change struct members from camelcase to snake case

1 files changed, 12 insertions, 12 deletions

diff --git a/src/graph.c b/src/graph.c
index 5f4b5d6..5ad439a 100644
--- a/src/graph.c
+++ b/src/graph.c
@@ -18,17 +18,17 @@ Graph *graph_new(int n) {
         return NULL;
     }
 
-    graph->numEdges = n;
-    graph->numVertices = 0;
+    graph->num_edges = n;
+    graph->num_vertices = 0;
     
     for (int i = 0; i < n; i++) {
         graph->vertices[i].id = i;
-        graph->vertices[i].outNeighbours = linked_list_new();
-        graph->vertices[i].inNeighbours = linked_list_new();
+        graph->vertices[i].out_neighbours = linked_list_new();
+        graph->vertices[i].in_neighbours = linked_list_new();
 
         // if allocation for the linked lists failed
-        if (!graph->vertices[i].outNeighbours
-            || !graph->vertices[i].inNeighbours) {
+        if (!graph->vertices[i].out_neighbours
+            || !graph->vertices[i].in_neighbours) {
             graph_delete(graph);
             return NULL;
         }
@@ -38,9 +38,9 @@ Graph *graph_new(int n) {
 }
 
 void graph_add_edge(Graph *g, int i, int j) {
-    linked_list_append(g->vertices[i].outNeighbours, &g->vertices[j]);
-    linked_list_append(g->vertices[j].inNeighbours, &g->vertices[i]);
-    g->numEdges++;
+    linked_list_append(g->vertices[i].out_neighbours, &g->vertices[j]);
+    linked_list_append(g->vertices[j].in_neighbours, &g->vertices[i]);
+    g->num_edges++;
 }
 
 Graph *graph_read(const char *filename) {
@@ -72,9 +72,9 @@ Graph *graph_read(const char *filename) {
 }
 
 void graph_delete(Graph *g) {
-    for (int i = 0; i < g->numVertices; i++) {
-        linked_list_delete(g->vertices[i].inNeighbours);
-        linked_list_delete(g->vertices[i].outNeighbours);
+    for (int i = 0; i < g->num_vertices; i++) {
+        linked_list_delete(g->vertices[i].in_neighbours);
+        linked_list_delete(g->vertices[i].out_neighbours);
     }
     free(g->vertices);
     free(g);