aboutsummaryrefslogtreecommitdiff
path: root/src/graph.h
diff options
context:
space:
mode:
authorMikkel Thestrup <mithe24@student.sdu.dk>2025-11-30 14:24:52 +0100
committerMikkel Thestrup <mithe24@student.sdu.dk>2025-11-30 14:24:52 +0100
commita23cb6d6f011950b11789898c10e63f4473a5200 (patch)
treee6f0c3c85e240848a03909639ac227db05f7da2a /src/graph.h
parent06be9b97b3cc575c69d037d6ba09950c0a53d7f3 (diff)
downloadcycle-detector-a23cb6d6f011950b11789898c10e63f4473a5200.tar.gz
cycle-detector-a23cb6d6f011950b11789898c10e63f4473a5200.zip
Updated every file and function to follow style guide
Diffstat (limited to '')
-rw-r--r--src/graph.h (renamed from src/Graph.h)12
1 files changed, 6 insertions, 6 deletions
diff --git a/src/Graph.h b/src/graph.h
index 3e7cfaa..ca90bbe 100644
--- a/src/Graph.h
+++ b/src/graph.h
@@ -1,7 +1,7 @@
#ifndef GRAPH_H
#define GRAPH_H
-#include "LinkedList.h"
+#include "linked_list.h"
typedef struct Vertex Vertex;
typedef struct Graph Graph;
@@ -20,21 +20,21 @@ struct Graph {
// Allocates and constructs a new graph with n vertices.
// Returns a pointer to the new graph, or NULL on error.
// Post: the caller owns the graph.
-Graph *Graph_new(int n);
+Graph *graph_new(int n);
// Adds an edge from the i'th to the j'th vertex (0-indexed).
-void Graph_addEdge(Graph *g, int i, int j);
+void graph_add_edge(Graph *g, int i, int j);
// Reads a graph from the given file and returns a newly
// constructed Graph representing it.
// Returns a pointer to the read graph, or NULL on error.
// Post: the caller owns the graph.
-Graph *Graph_read(const char *filename);
+Graph *graph_read(const char *filename);
// Deallocates the given graph and all its associated memory.
-void Graph_delete(Graph *g);
+void graph_delete(Graph *g);
// Prints some useful information about the given graph.
-void Graph_print(Graph *g);
+void graph_print(Graph *g);
#endif // GRAPH_H