aboutsummaryrefslogtreecommitdiff
path: root/src/cycle_detection.h
diff options
context:
space:
mode:
authorMikkel Thestrup <mithe24@student.sdu.dk>2025-12-04 21:16:10 +0100
committerMikkel Thestrup <mithe24@student.sdu.dk>2025-12-04 21:16:10 +0100
commit5ca163f446420c97af8a4fa37f6d0281a84bfbcf (patch)
tree492c98311142104f9df3b7a69b56d4c05a72efa8 /src/cycle_detection.h
parent16527faeedfd8d3a27d3ac505d882f84bd34ed67 (diff)
downloadcycle-detector-5ca163f446420c97af8a4fa37f6d0281a84bfbcf.tar.gz
cycle-detector-5ca163f446420c97af8a4fa37f6d0281a84bfbcf.zip
Less cringe docs
Diffstat (limited to 'src/cycle_detection.h')
-rw-r--r--src/cycle_detection.h7
1 files changed, 4 insertions, 3 deletions
diff --git a/src/cycle_detection.h b/src/cycle_detection.h
index e5e0220..9914435 100644
--- a/src/cycle_detection.h
+++ b/src/cycle_detection.h
@@ -17,9 +17,10 @@
* @param g Pointer to the directed graph to analyze.
* Must not be NULL.
*
- * @details Prints to stdout whether the given graph has a cycle. In that case
- * in prints 'CYCLE DETECTED!', else it prints the graph in
- * topological sorting i.e. '4, 0, 1, 3, 2'.
+ * @details Prints to stdout whether the given graph has a cycle;
+ * in that case in prints 'CYCLE DETECTED!',
+ * else it prints the graph in topological sorting
+ * i.e. '4, 0, 1, 3, 2'.
*
* @note The input graph @p g may be modified during execution. The function
* alters vertex in-degree counts and neighbor lists as part of the