-int dump_graph(struct evbuffer *out) {
- splay_node_t *node;
- node_t *n;
- edge_t *e;
-
- if(evbuffer_add_printf(out, "digraph {\n") == -1)
- return errno;
-
- /* dump all nodes first */
- for(node = node_tree->head; node; node = node->next) {
- n = node->data;
- if(evbuffer_add_printf(out, " %s [label = \"%s\"];\n",
- n->name, n->name) == -1)
- return errno;
- }
-
- /* now dump all edges */
- for(node = edge_weight_tree->head; node; node = node->next) {
- e = node->data;
- if(evbuffer_add_printf(out, " %s -> %s;\n",
- e->from->name, e->to->name) == -1)
- return errno;
+ if(!n->status.reachable)
+ update_node_udp(n, NULL);
+ else if(n->connection)
+ send_ans_key(n);
+ }