X-Git-Url: https://www.tinc-vpn.org/git/browse?p=tinc;a=blobdiff_plain;f=src%2Fgraph.c;h=f0a93aee3a7800b36712839e11e1ed5ec13ee5b5;hp=b7c285fa32dd59b852c5222b64fdc8b9ab674149;hb=c08858baa91a00e38c0f5482dbb0817dbd0361f1;hpb=38f562fdfcacb50d34b9a48bfaea7faa132f493a

diff --git a/src/graph.c b/src/graph.c
index b7c285fa..f0a93aee 100644
--- a/src/graph.c
+++ b/src/graph.c
@@ -17,7 +17,7 @@
     along with this program; if not, write to the Free Software
     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 
-    $Id: graph.c,v 1.1.2.21 2002/09/10 22:12:33 guus Exp $
+    $Id: graph.c,v 1.1.2.22 2003/01/17 00:37:17 guus Exp $
 */
 
 /* We need to generate two trees from the graph:
@@ -201,26 +201,25 @@ void sssp_bfs(void)
 
 				/* Situation:
 
-				   /
+				    /
 				   /
 				   ------(n)-----(e->to)
 				   \
-				   \
+				    \
 
 				   n->address is set to the e->address of the edge left of n to n.
 				   We are currently examining the edge e right of n from n:
 
 				   - If e->reverse->address != n->address, then e->to is probably
-				   not reachable for the nodes left of n. We do as if the indirectdata
-				   flag is set on edge e.
+				     not reachable for the nodes left of n. We do as if the indirectdata
+				     flag is set on edge e.
 				   - If edge e provides for better reachability of e->to, update
-				   e->to and (re)add it to the todo_tree to (re)examine the reachability
-				   of nodes behind it.
+				     e->to and (re)add it to the todo_tree to (re)examine the reachability
+				     of nodes behind it.
 				 */
 
 				indirect = n->status.indirect || e->options & OPTION_INDIRECT
-					|| ((n != myself)
-						&& sockaddrcmp(&n->address, &e->reverse->address));
+					|| ((n != myself) && sockaddrcmp(&n->address, &e->reverse->address));
 
 				if(e->to->status.visited
 				   && (!e->to->status.indirect || indirect))