aboutsummaryrefslogtreecommitdiff
path: root/src/Graph.h
diff options
context:
space:
mode:
authorMikkel Thestrup <mikkel_thestrup@mithe.dk>2025-11-29 20:46:42 +0100
committerMikkel Thestrup <mikkel_thestrup@mithe.dk>2025-11-29 20:46:42 +0100
commit892b47ea8b73882d98de0a7fddb358a9ddafdf9e (patch)
tree23ee473548a438c447a3fde6cb3a136bf28f86e3 /src/Graph.h
parent7e9c085f4fb9988490dc507ff2a9a121c80eb195 (diff)
downloadcycle-detector-892b47ea8b73882d98de0a7fddb358a9ddafdf9e.tar.gz
cycle-detector-892b47ea8b73882d98de0a7fddb358a9ddafdf9e.zip
relaced tabs with spaces
Diffstat (limited to 'src/Graph.h')
-rw-r--r--src/Graph.h12
1 files changed, 6 insertions, 6 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.