From 892b47ea8b73882d98de0a7fddb358a9ddafdf9e Mon Sep 17 00:00:00 2001 From: Mikkel Thestrup Date: Sat, 29 Nov 2025 20:46:42 +0100 Subject: relaced tabs with spaces --- src/Graph.h | 12 ++++++------ src/LinkedList.h | 12 ++++++------ src/main.c | 24 ++++++++++++------------ 3 files changed, 24 insertions(+), 24 deletions(-) diff --git a/src/Graph.h b/src/Graph.h index a0087ce..3e7cfaa 100644 --- a/src/Graph.h +++ b/src/Graph.h @@ -6,15 +6,15 @@ typedef struct Vertex Vertex; typedef struct Graph Graph; struct Vertex { - int id; // a number in [0; numVertices[ - LinkedList *outNeighbours; // A linked list of vertices. - LinkedList *inNeighbours; // A linked list of vertices + int id; // a number in [0; numVertices[ + LinkedList *outNeighbours; // A linked list of vertices. + LinkedList *inNeighbours; // A linked list of vertices }; struct Graph { - int numVertices; - int numEdges; - Vertex *vertices; // An array of numVertices vertices + int numVertices; + int numEdges; + Vertex *vertices; // An array of numVertices vertices }; // Allocates and constructs a new graph with n vertices. diff --git a/src/LinkedList.h b/src/LinkedList.h index f30d44b..57538e2 100644 --- a/src/LinkedList.h +++ b/src/LinkedList.h @@ -8,15 +8,15 @@ typedef struct LinkedList LinkedList; typedef struct LinkedListNode LinkedListNode; struct LinkedList { - LinkedListNode *head; - LinkedListNode *tail; - int size; + LinkedListNode *head; + LinkedListNode *tail; + int size; }; struct LinkedListNode { - LinkedListNode *next; - LinkedListNode *prev; - void *data; + LinkedListNode *next; + LinkedListNode *prev; + void *data; }; // Allocate and initialize an empty linked list. diff --git a/src/main.c b/src/main.c index 1ab1ebc..e347552 100644 --- a/src/main.c +++ b/src/main.c @@ -4,16 +4,16 @@ #include int main(int argc, char **argv) { - if(argc < 2) { - printf("Missing argument: input file\n"); - printf("Usage:\n"); - printf("%s \n", argv[0]); - return 1; - } - - Graph *g = Graph_read(argv[1]); - if(!g) return 2; - cycleDetection(g); - Graph_delete(g); - return 0; + if(argc < 2) { + printf("Missing argument: input file\n"); + printf("Usage:\n"); + printf("%s \n", argv[0]); + return 1; + } + + Graph *g = Graph_read(argv[1]); + if(!g) return 2; + cycleDetection(g); + Graph_delete(g); + return 0; } -- cgit v1.2.3-70-g09d2