#include "subnet.h"
#include "utils.h"
#include "xalloc.h"
+#include "graph.h"
/* Implementation of Kruskal's algorithm.
Running time: O(E)
Running time: O(N^2)
*/
-void sssp_dijkstra(void) {
+static void sssp_dijkstra(void) {
splay_node_t *node, *to;
edge_t *e;
node_t *n, *m;
list_free(todo_list);
}
-void check_reachability() {
+static void check_reachability(void) {
splay_node_t *node, *next;
node_t *n;
char *name;
n->minmtu = 0;
n->mtuprobes = 0;
- event_del(&n->mtuevent);
+ if(timeout_initialized(&n->mtuevent))
+ event_del(&n->mtuevent);
xasprintf(&envp[0], "NETNAME=%s", netname ? : "");
xasprintf(&envp[1], "DEVICE=%s", device ? : "");