#include "subnet.h"
#include "utils.h"
-static bool graph_changed = true;
-
/* Implementation of Kruskal's algorithm.
Running time: O(EN)
Please note that sorting on weight is already done by add_edge().
/* Starting point */
- ((edge_t *) edge_weight_tree->head->data)->from->status.visited = true;
+ for(node = edge_weight_tree->head; node; node = node->next) {
+ e = node->data;
+ if(e->from->status.reachable) {
+ e->from->status.visited = true;
+ break;
+ }
+ }
/* Add safe edges */
}
}
-void graph(void)
-{
- mst_kruskal();
- sssp_bfs();
- graph_changed = true;
-}
-
-
-
/* Dump nodes and edges to a graphviz file.
The file can be converted to an image with
dot -Tpng graph_filename -o image_filename.png -Gconcentrate=true
*/
-void dump_graph(void)
+static void dump_graph(int fd, short events, void *data)
{
avl_node_t *node;
node_t *n;
char *filename = NULL, *tmpname = NULL;
FILE *file;
- if(!graph_changed || !get_config_string(lookup_config(config_tree, "GraphDumpFile"), &filename))
+ if(!get_config_string(lookup_config(config_tree, "GraphDumpFile"), &filename))
return;
- graph_changed = false;
-
ifdebug(PROTOCOL) logger(LOG_NOTICE, "Dumping graph");
if(filename[0] == '|') {
fprintf(file, "}\n");
- fclose(file);
-
- if(filename[0] != '|') {
+ if(filename[0] == '|') {
+ pclose(file);
+ } else {
+ fclose(file);
+#ifdef HAVE_MINGW
+ unlink(filename);
+#endif
rename(tmpname, filename);
free(tmpname);
}
}
+
+void graph(void)
+{
+ static struct event ev;
+
+ sssp_bfs();
+ mst_kruskal();
+
+ if(!ev.ev_callback)
+ timeout_set(&ev, dump_graph, NULL);
+ event_add(&ev, &(struct timeval){5, 0});
+}