Function edge_partitioning

interface/kaHIP_interface.cpp:669–705

};

void edge_partitioning(int* n, int* vwgt, kahip_idx* xadj,
                   kahip_idx* adjcwgt, kahip_idx* adjncy, int* nparts,
                   double* imbalance, bool suppress_output, int seed, int mode,
                   int* vertexcut, int* part, kahip_idx infinity_edge_weight) {
        configuration cfg;
        PartitionConfig partition_config;
        partition_config.k = *nparts;

        internal_kaffpa_set_configuration(cfg, partition_config, mode);

        partition_config.seed = seed;
        partition_config.imbalance = 100*(*imbalance);

        graph_access G;     
        internal_build_graph( partition_config, n, vwgt, xadj, adjcwgt, adjncy, G);

        spac splitter(G, infinity_edge_weight);
        graph_access &split_G = splitter.construct_split_graph();

        balance_configuration bc;
        bc.configurate_balance(partition_config, split_G);

        std::srand(static_cast<unsigned int>(seed));
        random_functions::setSeed(seed);

        graph_partitioner partitioner;
        partitioner.perform_partitioning(partition_config, split_G);

        splitter.fix_cut_dominant_edges();
        std::vector<PartitionID> edge_partition = splitter.project_partition();

        *vertexcut = static_cast<int>(splitter.calculate_vertex_cut(edge_partition));

        for (std::size_t i = 0; i < edge_partition.size(); ++i) {
            part[i] = edge_partition[i];
        }
}