Use Dijkstra's algorithm. Based on patches from Max Rijevskiy.

[tinc] / src / node.h

diff --git a/src/node.h b/src/node.h
index fee68593eafc86bd88ed266119d8cfa16f40343e..da5081b49ef0dd5cc3506862443502c9a8ba1cc1 100644 (file)
--- a/src/node.h
+++ b/src/node.h
@@ -60,6 +60,7 @@ typedef struct node_t {
 
        list_t *queue;                          /* Queue for packets awaiting to be encrypted */
 
+       int distance;
        struct node_t *nexthop;                 /* nearest node from us to him */
        struct node_t *via;                     /* next hop for UDP packets */