j3d1/tinc
1
0
Fork 0
Code Issues 1 Pull requests Releases Wiki Activity

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

Browse source
This commit is contained in:
Guus Sliepen 2008-12-11 18:07:26 +00:00
parent 26a228e302
commit 6e80da3370
3 changed files with 141 additions and 40 deletions
Download patch file Download diff file Expand all files Collapse all files

1
src/node.h
View file

@ -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 */