aboutsummaryrefslogtreecommitdiff
path: root/src/graph.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/graph.h')
-rw-r--r--src/graph.h8
1 files changed, 2 insertions, 6 deletions
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);