formatting and portability

[graph-theory.git] / gt.c

diff --git a/gt.c b/gt.c
index 0013cf940fa3073ae8deeba5d178367b792bf220..a3c112a21e9517a2853bf42bd05bb12554a73c96 100644 (file)
--- a/gt.c
+++ b/gt.c
@@ -1,10 +1,10 @@
 #define _GNU_SOURCE
+#include "graph/adj.h"
+#include "graph/dfs.h"
+#include "lib/dbg.h"
 #include <getopt.h>
 #include <stdio.h>
 #include <stdlib.h>
-#include "lib/dbg.h"
-#include "graph/adj.h"
-#include "graph/dfs.h"
 
 #define bfs dfs /* stub until tomorrow */
 
@@ -67,11 +67,9 @@ main (int argc, char **argv)
   unsigned int nv, u, v;
   int i;
 
-  static struct option long_opts[] = {
-    {"dfs", no_argument, 0, 'd'},
-    {"bfs", no_argument, 0, 'b'},
-    {0, 0, 0, 0}
-  };
+  static struct option long_opts[] = { { "dfs", no_argument, 0, 'd' },
+                                       { "bfs", no_argument, 0, 'b' },
+                                       { 0, 0, 0, 0 } };
 
   while ((c = getopt_long (argc, argv, "db", long_opts, NULL)) != -1)
     {
@@ -84,7 +82,8 @@ main (int argc, char **argv)
           a = ALGO_BFS;
           break;
         default:
-          fprintf (stderr, "Usage: %s [--dfs|--bfs] <nv> [u1 v1 ...]\n", argv[0]);
+          fprintf (stderr, "Usage: %s [--dfs|--bfs] <nv> [u1 v1 ...]\n",
+                   argv[0]);
           exit (EXIT_FAILURE);
         }
     }
@@ -95,14 +94,14 @@ main (int argc, char **argv)
   if (optind >= argc)
     fatal ("missing number of vertices");
 
-  nv = (unsigned int) atoi (argv[optind]);
+  nv = (unsigned int)atoi (argv[optind]);
   if (!(g = new_graph (nv)))
     fatal ("new_graph ()");
 
   for (i = optind + 1; i < argc - 1; i += 2)
     {
-      u = (unsigned int) atoi (argv[i]);
-      v = (unsigned int) atoi (argv[i + 1]);
+      u = (unsigned int)atoi (argv[i]);
+      v = (unsigned int)atoi (argv[i + 1]);
       if (add_edge (g, u, v))
         fatal ("add_edge ()");
     }