/*
graph.c -- graph algorithms
- Copyright (C) 2001-2009 Guus Sliepen <guus@tinc-vpn.org>,
+ Copyright (C) 2001-2010 Guus Sliepen <guus@tinc-vpn.org>,
2001-2005 Ivo Timmermans
This program is free software; you can redistribute it and/or modify
#include "netutl.h"
#include "node.h"
#include "process.h"
+#include "protocol.h"
#include "subnet.h"
#include "utils.h"
#include "xalloc.h"
/* Mark this node as visited and remove it from the todo_list */
n->status.visited = true;
- list_unlink_node(todo_list, nnode);
+ list_delete_node(todo_list, nnode);
/* Update distance of neighbours and add them to the todo_list */
/* TODO: only clear status.validkey if node is unreachable? */
n->status.validkey = false;
- n->status.waitingforkey = false;
+ n->last_req_key = 0;
n->maxmtu = MTU;
n->minmtu = 0;
if(!n->status.reachable)
update_node_udp(n, NULL);
+ else if(n->connection)
+ send_ans_key(n);
}
}
}