From 5ca163f446420c97af8a4fa37f6d0281a84bfbcf Mon Sep 17 00:00:00 2001 From: Mikkel Thestrup Date: Thu, 4 Dec 2025 21:16:10 +0100 Subject: Less cringe docs --- src/graph.h | 8 ++------ 1 file changed, 2 insertions(+), 6 deletions(-) (limited to 'src/graph.h') diff --git a/src/graph.h b/src/graph.h index ca9f32a..00d4d6c 100644 --- a/src/graph.h +++ b/src/graph.h @@ -2,8 +2,7 @@ * @file graph.h * @brief Directed graph implementation using adjacency lists. * @details This module provides a directed graph data structure where each - * vertex maintains separate lists of outgoing and incoming neighbors, - * enabling efficient navigation in both directions. + * vertex maintains separate lists of outgoing and incoming neighbors. */ #ifndef GRAPH_H @@ -79,9 +78,7 @@ struct Graph { /** * @brief Array of all vertices in the graph. * @details An array of size num_vertices containing Vertex structures. - * Index i contains the vertex with id = i. The array is - * dynamically allocated and should be freed by the caller - * when the graph is no longer needed. + * Index i contains the vertex with id = i. */ Vertex *vertices; }; @@ -133,7 +130,6 @@ Graph *graph_read(const char *filename); * @brief Deallocates the given graph and all its associated memory. * * @param g Pointer to the graph to delete. - * If NULL, this function does nothing. */ void graph_delete(Graph *g); -- cgit v1.2.3-70-g09d2