     if (total_queued > 0)
     {
         // measure duplicate edges put through queue
-        redundant_work = ((double)total_queued - edges_visited) / edges_visited;
+        redundant_work =
+            ((double)total_queued - edges_visited) / edges_visited;
     }
     redundant_work *= 100;
 

        // Display the specific sample statistics
        double m_teps = (double) edges_visited / (elapsed * 1000.0);
        if (!g_quiet) {
            printf("\n elapsed: %.4f ms, rate: %.4f MiEdges/s", elapsed, m_teps);
        }
        info["elapsed"] = elapsed;
        info["m_teps"] = m_teps;

    //srand(0); // Presently deterministic
    //srand(time(NULL));

    std::string graph_type = argv[1];
    int flags = args.ParsedArgc();
    int graph_args = argc - flags - 1;
