Iterating over all found minimum cuts #10
Description
Hello! I have a question concerning your cactus_mincut data structure, and the hierarchy of your minimum_cut data structures as a whole. Say that I have the code below, where I am performing a cactus mincut on some std::shared_ptr<mutable_graph> G that I constructed elsewhere beforehand. In your internal code, I can see that a cactus_mincut call calls a method called findAllMincuts. From here, it becomes a little difficult to follow the code since I am not super familiar with your code base, but are any intermediary cuts saved in some data structure from within findAllMincuts? I assume, which might be an incorrect assumption, that all the minimum cuts are generated and must be saved to then find the most balanced minimum cut, that we have configured to do so. Is there a way to iterate over all of these minimum cuts that are found? Thanks!
cfg->find_most_balanced_cut = true;
cfg->threads = 1;
cfg->save_cut = true;
cfg->set_node_in_cut = true;
cactus_mincut<std::shared_ptr<mutable_graph>> cmc;
edge_cut_size = cmc.perform_minimum_cut(G);