Minor optimization in r_graph ##util

libr/include/r_util/r_graph.h

@@ -8,7 +8,7 @@ extern "C" {
 #endif
 
 typedef struct r_graph_node_t {
-	unsigned int idx;
+	ut32 idx;
 	void *data;
 	RList *out_nodes;
 	RList *in_nodes;
@@ -19,13 +19,13 @@ typedef struct r_graph_node_t {
 typedef struct r_graph_edge_t {
 	RGraphNode *from;
 	RGraphNode *to;
-	int nth;
+	st32 nth;
 } RGraphEdge;
 
 typedef struct r_graph_t {
-	unsigned int n_nodes;
-	unsigned int n_edges;
-	int last_index;
+	ut32 n_nodes;
+	ut32 n_edges;
+	st32 last_index;
 	RList *nodes; /* RGraphNode */
 } RGraph;
 

libr/util/graph.c

@@ -12,7 +12,8 @@ static RGraphNode *r_graph_node_new(void *data) {
 	RGraphNode *p = R_NEW0 (RGraphNode);
 	if (p) {
 		p->data = data;
-		p->free = NULL;
+// R_NEW0 already sets p->free to NULL
+//		p->free = NULL;
 		p->out_nodes = r_list_new ();
 		p->in_nodes = r_list_new ();
 		p->all_neighbours = r_list_new ();