/home/coin/SVN-release/OS-2.4.0/Bcp/examples/MaxCut/CG/MC_shortest_path_cycle.cpp File Reference

#include <queue>
#include <vector>
#include "CoinSort.hpp"
#include "MC.hpp"
#include "MC_cut.hpp"
#include "BCP_matrix.hpp"

Include dependency graph for MC_shortest_path_cycle.cpp:

Go to the source code of this file.

Functions

void MC_create_shortest_path_cut (const int n, const int sp_tree_root, const MC_graph_edge *edges, const MC_path_node *bp_nodes, BCP_vec< BCP_cut * > &new_cuts, BCP_vec< BCP_row * > &new_rows, int *itmp, double *dtmp)
int MC_find_components (const int nodenum, const MC_path_node *bp_nodes, int *component)
void MC_generate_shortest_path_cycles (const MC_problem &mc, const double *x, const bool generate_all_cuts, const double minviol, BCP_vec< BCP_cut * > &new_cuts, BCP_vec< BCP_row * > &new_rows)


Function Documentation

void MC_create_shortest_path_cut ( const int  n,
const int  sp_tree_root,
const MC_graph_edge edges,
const MC_path_node bp_nodes,
BCP_vec< BCP_cut * > &  new_cuts,
BCP_vec< BCP_row * > &  new_rows,
int *  itmp,
double *  dtmp 
)

Definition at line 17 of file MC_shortest_path_cycle.cpp.

References BCP_DBL_MAX, MC_path_node::edge_to_parent, MC_path_node::parent, and BCP_vec< T >::push_back().

Referenced by MC_generate_shortest_path_cycles().

int MC_find_components ( const int  nodenum,
const MC_path_node bp_nodes,
int *  component 
)

Definition at line 57 of file MC_shortest_path_cycle.cpp.

References MC_path_node::adj_list.

Referenced by MC_generate_shortest_path_cycles().

void MC_generate_shortest_path_cycles ( const MC_problem mc,
const double *  x,
const bool  generate_all_cuts,
const double  minviol,
BCP_vec< BCP_cut * > &  new_cuts,
BCP_vec< BCP_row * > &  new_rows 
)

Definition at line 89 of file MC_shortest_path_cycle.cpp.

References MC_path_node::adj_list, MC_path_adj_entry::cost, MC_path_node::degree, distance(), MC_path_node::distance, MC_path_node::edge_to_parent, MC_problem::edges, m, MC_create_shortest_path_cut(), MC_find_components(), n, MC_path_adj_entry::neighbor, nt, MC_problem::num_edges, MC_problem::num_nodes, MC_path_adj_entry::orig_edge, MC_path_node::parent, MC_path_node::processed, and BCP_vec< T >::size().

Referenced by MC_lp::generate_sp_cuts().


Generated on Thu Sep 22 03:06:26 2011 by  doxygen 1.4.7