diff options
| author | Mikkel Thestrup <mithe24@student.sdu.dk> | 2025-12-12 00:18:07 +0100 |
|---|---|---|
| committer | Mikkel Thestrup <mithe24@student.sdu.dk> | 2025-12-12 00:18:07 +0100 |
| commit | c7a15432c2bbf517bdf12124da1971f7ea254506 (patch) | |
| tree | 1d7c7d29e3c9df712e5e93fd12b6b91d06c19e6e /src/cycle_detection.c | |
| parent | b392c57c4af46ec32d4797983d353a84c6846e98 (diff) | |
| download | cycle-detector-c7a15432c2bbf517bdf12124da1971f7ea254506.tar.gz cycle-detector-c7a15432c2bbf517bdf12124da1971f7ea254506.zip | |
Need to initalize the array to 0 ofce
Diffstat (limited to 'src/cycle_detection.c')
| -rw-r--r-- | src/cycle_detection.c | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/src/cycle_detection.c b/src/cycle_detection.c index 4bbf62b..74f4a3c 100644 --- a/src/cycle_detection.c +++ b/src/cycle_detection.c @@ -4,10 +4,12 @@ #include "vector.h" #include <stdio.h> #include <stdint.h> +#include <string.h> void cycle_detection(Graph *g) { int n = g->num_vertices; int indegree[n]; + memset(indegree, 0, n * sizeof(int)); LinkedList *queue = linked_list_new(); if (!queue) { |