Function main

app/fast_node_ordering.cpp:24–156

#include "tools/timer.h"

int main(int argn, char **argv) {
        PartitionConfig partition_config;
        std::string graph_filename;

        bool is_graph_weighted = false;
        bool suppress_output = false;
        bool recursive = false;

        int ret_code = parse_parameters(argn, argv,
                                        partition_config,
                                        graph_filename,
                                        is_graph_weighted,
                                        suppress_output, recursive);

        if (ret_code) {
                return 0;
        }

        // Backup stdout
        std::streambuf* backup = std::cout.rdbuf();
        if(suppress_output) {
                std::cout.rdbuf(nullptr);
        }

        graph_access input_graph;

        timer t;
        graph_io::readGraphWeighted(input_graph, graph_filename);
        std::cout << "io time: " << t.elapsed() << std::endl;

        // Make input_graph unweighted
        bool has_node_weights = false;
        forall_nodes(input_graph, node) {
                if (input_graph.getNodeWeight(node) != 1) {
                        has_node_weights = true;
                }
                input_graph.setNodeWeight(node, 1);
        } endfor
        if (has_node_weights) {
                std::cout << "There were nodes with weight != 1" << std::endl;
        }
        std::cout << "graph has " << input_graph.number_of_nodes() << " nodes and "
                                  << input_graph.number_of_edges() << " edges" << std::endl;

        timer full_nd_timer;
        full_nd_timer.restart();
        t.restart();
        // 'active_graph' is the graph to use after reductions have been applied.
        // If no reductions have been applied, 'active_graph' points to 'input_graph'.
        // Otherwise, it points to 'reduction_stack.back()->get_reduced_graph()'.
        graph_access *active_graph;
        std::vector<std::unique_ptr<Reduction>> reduction_stack;
        bool used_reductions = apply_reductions(partition_config, input_graph, reduction_stack);
        if (used_reductions) {
                active_graph = &reduction_stack.back()->get_reduced_graph();
        } else {
                active_graph = &input_graph;
        }