diff --git a/librz/core/cgraph.c b/librz/core/cgraph.c
index 4d8d0f259d4..2f149cc9762 100644
--- a/librz/core/cgraph.c
+++ b/librz/core/cgraph.c
@@ -867,6 +867,7 @@ static void extend_icfg(const RzAnalysis *analysis, RZ_BORROW RzGraph /*<RzGraph
 			continue;
 		}
 		RzGraphNode *to_node = get_graph_node_of_fcn(icfg, graph_idx, called_fcn);
+		assert(to_node && from_node);
 		if (rz_graph_adjacent(icfg, from_node, to_node)) {
 			// Edge already added and walked. Don't recurse.
 			continue;
diff --git a/librz/util/graph.c b/librz/util/graph.c
index 8c5dd535bee..05c41a4b021 100644
--- a/librz/util/graph.c
+++ b/librz/util/graph.c
@@ -291,7 +291,20 @@ RZ_API const RzList *rz_graph_get_nodes(const RzGraph *g) {
 	return g ? g->nodes : NULL;
 }
 
-/* true if there is an edge from the node `from` to the node `to` */
+/**
+ * \brief Checks if the edge \p from -> \p to exists in the graph.
+ * For this it checks the neighbors of \p from.
+ *
+ * \param g The graph to check.
+ * \param from The pointer to the source node of the edge. The pointer must be a node in the graph.
+ * \param to The destination node of the edge. The pointer must be a node in the graph.
+ *
+ * NOTE: It only compares the pointer of \p to against the neighbor list of \p from.
+ * If the pointer doesn't match it returns false. Even if the node content is the same.
+ *
+ * \returns true If there is an edge from the node `from` to the node `to`
+ * \return false Otherwise
+ */
 RZ_API bool rz_graph_adjacent(const RzGraph *g, const RzGraphNode *from, const RzGraphNode *to) {
 	if (!g || !from) {
 		return false;