A | fm_partition | static |
algorithm() | algorithm | inline |
aside | fm_partition | protected |
B | fm_partition | static |
balance_holds(const graph &G, const node cur_node) | fm_partition | protected |
bside | fm_partition | protected |
bucketA | fm_partition | protected |
bucketA_empty | fm_partition | protected |
bucketB | fm_partition | protected |
bucketB_empty | fm_partition | protected |
check(graph &G) | fm_partition | virtual |
clean_pass(const graph &G) | fm_partition | protected |
compute_cut_edges(const graph &G) | fm_partition | protected |
compute_max_vertex_degree(const graph &G) | fm_partition | protected |
compute_nodesAB(const graph &G) | fm_partition | protected |
copy_side_node_map(const graph &G, node_map< side_type > &dest, const node_map< side_type > source) const | fm_partition | protected |
create_initial_bipart(const graph &G) | fm_partition | protected |
cur_cutsize | fm_partition | protected |
cut_edges | fm_partition | protected |
cut_edges_begin() const | fm_partition | |
cut_edges_end() const | fm_partition | |
cut_edges_iterator typedef | fm_partition | |
divide_up(const graph &G) | fm_partition | protected |
edge_weight | fm_partition | protected |
enable_cut_edges_storing | fm_partition | protected |
enable_nodesAB_storing | fm_partition | protected |
fix_type typedef | fm_partition | |
FIXA | fm_partition | static |
FIXB | fm_partition | static |
fixed | fm_partition | protected |
fm_partition() | fm_partition | |
gain_value | fm_partition | protected |
get_cutsize() | fm_partition | |
get_needed_passes() | fm_partition | |
get_side_of_node(const node &n) const | fm_partition | |
get_weight_on_sideA(const graph &G) const | fm_partition | |
get_weight_on_sideB(const graph &G) const | fm_partition | |
GTL_ERROR enum value | algorithm | |
GTL_OK enum value | algorithm | |
hide_self_loops(graph &G) | fm_partition | protected |
init_data_structure(const graph &G) | fm_partition | protected |
init_filling_buckets(const graph &G) | fm_partition | protected |
init_variables(const graph &G) | fm_partition | protected |
inital_gain_of_node_on_sideA(const node cur_node) | fm_partition | protected |
inital_gain_of_node_on_sideB(const node cur_node) | fm_partition | protected |
max_edge_weight | fm_partition | protected |
max_gainA | fm_partition | protected |
max_gainB | fm_partition | protected |
max_node_weight | fm_partition | protected |
max_vertex_degree | fm_partition | protected |
move_manager(const graph &G) | fm_partition | protected |
move_vertex(const graph &G, node &moved_node) | fm_partition | protected |
no_passes | fm_partition | protected |
node_weight | fm_partition | protected |
node_weight_on_sideA | fm_partition | protected |
node_weight_on_sideB | fm_partition | protected |
nodes_of_one_side_iterator typedef | fm_partition | |
nodes_of_sideA_begin() const | fm_partition | |
nodes_of_sideA_end() const | fm_partition | |
nodes_of_sideB_begin() const | fm_partition | |
nodes_of_sideB_end() const | fm_partition | |
nodesA | fm_partition | protected |
nodesB | fm_partition | protected |
operator[](const node &n) const | fm_partition | |
pass_manager(const graph &G) | fm_partition | protected |
position_in_bucket | fm_partition | protected |
provided_fix | fm_partition | protected |
provided_initial_part | fm_partition | protected |
range_down(const int index) const | fm_partition | inlineprotected |
range_up(const int gain_value) const | fm_partition | inlineprotected |
reset() | fm_partition | virtual |
run(graph &G) | fm_partition | virtual |
set_vars(const graph &G, const node_map< int > &node_weight, const edge_map< int > &edge_weight) | fm_partition | |
set_vars(const graph &G, const node_map< int > &node_weight, const edge_map< int > &edge_weight, const node_map< side_type > &init_side) | fm_partition | |
set_vars(const graph &G, const node_map< int > &node_weight, const edge_map< int > &edge_weight, const node_map< fix_type > &fixed) | fm_partition | |
set_vars(const graph &G, const node_map< int > &node_weight, const edge_map< int > &edge_weight, const node_map< side_type > &init_side, const node_map< fix_type > &fixed) | fm_partition | |
set_vars_executed | fm_partition | protected |
shuffle_vector(const int vector_size, vector< graph::node_iterator > &node_vector) | fm_partition | protected |
side | fm_partition | protected |
side_type typedef | fm_partition | |
store_cut_edges(const bool set) | fm_partition | |
store_nodesAB(const bool set) | fm_partition | |
total_node_weight | fm_partition | protected |
UNFIXED | fm_partition | static |
unlockedA | fm_partition | protected |
unlockedB | fm_partition | protected |
update_bucketA(const node cur_node, const int old_gain, const int new_gain) | fm_partition | protected |
update_bucketB(const node cur_node, const int old_gain, const int new_gain) | fm_partition | protected |
update_data_structure_A2B(const node cur_node) | fm_partition | protected |
update_data_structure_B2A(const node cur_node) | fm_partition | protected |
update_max_gain(const side_type side) | fm_partition | protected |
~algorithm() | algorithm | inlinevirtual |
~fm_partition() | fm_partition | virtual |