#include <cassert>
#include <algorithm>
#include <numeric>
#include "CoinHelperFunctions.hpp"
#include "MC_cut.hpp"
#include "MC.hpp"
Include dependency graph for MC_kruskal.cpp:
Go to the source code of this file.
Functions | |
static void | MC_label_neighbors (const int this_node, const int *degree, const int *neighbornode, const int *neighboredge, int *parentnode, int *parentedge) |
void | MC_kruskal (const MC_problem &mc, const int *edgeorder, const double *x, int *nodesign, int *edges_in_tree) |
void | MC_kruskal (const MC_problem &mc, const int *edgeorder, const double *x, int *nodesign, int *parentnode, int *parentedge) |
static void MC_label_neighbors | ( | const int | this_node, | |
const int * | degree, | |||
const int * | neighbornode, | |||
const int * | neighboredge, | |||
int * | parentnode, | |||
int * | parentedge | |||
) | [static] |
void MC_kruskal | ( | const MC_problem & | mc, | |
const int * | edgeorder, | |||
const double * | x, | |||
int * | nodesign, | |||
int * | edges_in_tree | |||
) |
Definition at line 33 of file MC_kruskal.cpp.
References MC_problem::edges, MC_graph_edge::head, k, m, n, MC_problem::num_edges, MC_problem::num_nodes, and MC_graph_edge::tail.
void MC_kruskal | ( | const MC_problem & | mc, | |
const int * | edgeorder, | |||
const double * | x, | |||
int * | nodesign, | |||
int * | parentnode, | |||
int * | parentedge | |||
) |
Definition at line 129 of file MC_kruskal.cpp.
References MC_problem::edges, MC_graph_edge::head, k, MC_kruskal(), MC_label_neighbors(), n, MC_problem::num_nodes, and MC_graph_edge::tail.