+/* Return an array of edges in the current network graph.
+ * Data captures the current state and will not be updated.
+ * Caller must deallocate data when done.
+ */
+devtool_edge_t *devtool_get_all_edges(meshlink_handle_t *mesh, devtool_edge_t *edges, size_t *nmemb) {
+ if(!mesh || !nmemb || (*nmemb && !edges)) {
+ meshlink_errno = MESHLINK_EINVAL;
+ return NULL;
+ }
+
+ pthread_mutex_lock(&(mesh->mesh_mutex));
+
+ devtool_edge_t *result = NULL;
+ unsigned int result_size = 0;
+
+ result_size = mesh->edges->count / 2;
+
+ // if result is smaller than edges, we have to dealloc all the excess devtool_edge_t
+ if((size_t)result_size > *nmemb) {
+ result = realloc(edges, result_size * sizeof(*result));
+ } else {
+ result = edges;
+ }
+
+ if(result) {
+ devtool_edge_t *p = result;
+ unsigned int n = 0;
+
+ for splay_each(edge_t, e, mesh->edges) {
+ // skip edges that do not represent a two-directional connection
+ if((!e->reverse) || (e->reverse->to != e->from)) {
+ continue;
+ }
+
+ // don't count edges twice
+ if(e->to < e->from) {
+ continue;
+ }
+
+ assert(n < result_size);
+
+ p->from = (meshlink_node_t *)e->from;
+ p->to = (meshlink_node_t *)e->to;
+ p->address = e->address.storage;
+ p->options = e->options;
+ p->weight = e->weight;
+
+ n++;
+ p++;
+ }
+
+ // shrink result to the actual amount of memory used
+ result = realloc(result, n * sizeof(*result));
+ *nmemb = n;
+ } else {
+ *nmemb = 0;
+ meshlink_errno = MESHLINK_ENOMEM;
+ }
+
+ pthread_mutex_unlock(&(mesh->mesh_mutex));
+
+ return result;
+}
+