angel
mercurial changeset: <a href="http://mercurial.mcs.anl.gov/ad/RoseFE_angel/rev/b18cec041a55" target="_parent">b18cec041a55</a>
|
angel | Namespace for the complete library |
base_exception | |
io_exception | |
consistency_exception | |
write_edge_eliad_op_t | Operator used in write_graph_eliad |
no_output_t | |
string_stream_output_t | |
stream_output_t | |
vis_display_output_t | |
write_vertex_op_t | |
write_edge_op_t | |
write_edge_bool_op_t | |
write_edge_name_op_t | |
write_face_op_t | |
write_face_number_op_t | |
edge_equal_t | Compares edges of different graphs |
edge_less_t | Compares edges of different graphs (lexicographically) |
lex_less_face_line_t | |
not_lex_less_face_line_t | |
dec_greater | |
empty_operator_t | Empty operator class for dummy arguments |
EdgeType | |
VertexVisited | Pure BGL type definition of c-graph |
c_graph_t | C-graph type |
line_graph_t | Line graph type |
triplet_t | Triplet of faces, used in face_elimination_history_t |
predecessor_t | |
successor_t | |
edge_elim_t | Edge edge to eliminate from c-graph and whether it should be front or back eliminated |
edge_pair_elim_t | |
edge_ij_elim_t | |
accu_exp_t | |
ref_t | |
accu_exp_graph_t | |
accu_graph_t | |
EdgeRef_t | |
edge_reroute_t | |
EdgeElim | Graph-independent edge elimination |
Rerouting | Graph-independent rerouting |
Transformation | Graph-independent transformation |
elimSeq_cost_t | |
transformationSeq_cost_t | |
edge_vertex_elim_t | |
elimination_history_t | Elimination history |
random_init_t | |
base_heuristic_t | |
forward_mode_vertex_t | Operator class for forward mode in vertex elimination |
reverse_mode_vertex_t | Operator class for reverse mode in vertex elimination |
lowest_markowitz_vertex_t | Operator class for lowest Markowitz in vertex elimination |
lowest_relative_markowitz_vertex_t | Operator class for relative lowest Markowitz in vertex elimination |
lowest_fill_in_vertex_t | Operator class for lowest fill-in in vertex elimination |
lmmd_vertex_t | Class for lowest Markowitz with minimal damage in vertex elimination |
momr_vertex_t | Operator class for maximal overall Markowitz degree reduction in vertex elimination |
moplr_vertex_t | Operator class for maximal overall path length reduction in vertex elimination |
forward_mode_edge_t | Operator class for mixed forward edge elimination |
reverse_mode_edge_t | Operator class for mixed reverse edge elimination |
lowest_markowitz_edge_t | Operator class for lowest Markowitz in mixed edge elimination |
lowest_relative_markowitz_edge_t | Operator class for lowest relative Markowitz in mixed edge elimination |
lmmd_edge_t | Class for lowest Markowitz with minimal damage in mixed edge elimination |
momr_edge_t | Operator class for lowest Markowitz in mixed edge elimination |
minimal_distance_edge_t | Minimizes the maximal distance of vertices involved in an edge elimination The motivation is that for small distances it is not very probable to re-insert one of new edges later |
forward_mode_face_t | Operator class for forward mode in face elimination |
reverse_mode_face_t | Operator class for reverse mode in vertex elimination |
reverse_mode_face_whole_vertex_t | Operator class for reverse_mode_face_whole_vertex |
lowest_markowitz_face_t | |
lowest_markowitz_face_complete_t | Lowest Markowitz for face elimination with completion of vertex elimination |
momr_face_t | Operator class for maximal overall Markowitz degree reduction in face elimination |
minimal_distance_face_t | Minimal distance for face elimination |
edge_ij_elim_heuristic_t | Creates a heuristic for (i,j,front) type from a heuristic for (edge,front) |
triplet_heuristic_t | Creates a heuristic for triplet type from a heuristic for faces |
emulated_vertex_heuristic_t | Simulates vertex elimination heuristics with edge eliminations |
heuristic_pair_t | Make a pair of heuristics |
heuristic_triplet_t | Make a pair of heuristics |
LOG_temperature_t | Functor that returns logarithmic temperature for LSA |
fixed_temperature_t | Functor that returns fixed temperature |
SA_elimination_cost_t | Computes the elimination costs for arbitrary elimination history type |
neighbor_last_removable_t | SA neighborhood either eliminate sth from eh.cg or undo last elimination |
neighbor_multi_step_t | SA neighborhood for multiple eliminations or re-insertions |
neighbor_sequence_check_t | SA neighborhood either eliminate face from eh.cg or undo some previous elimination |
neighbor_check_meta_t | SA neighborhood either eliminate face from eh.cg or undo some previous elimination |
gamma_adaption_max_t | adaption on maximal min-max-difference |
gamma_adaption_average_t | adaption on average min-max-difference |
lmv_op_t | |
lrm_op_t | |
fiv_op_t | |
markowitz_enlargement_front_t | |
markowitz_enlargement_back_t | |
lmmdv_op_t | |
momrv_op_t | |
oplrv_op_t | |
lme_op_t | |
lmmde_op_t | |
momre_op_t | |
diste_op_t | |
lmf_op_t | |
new_pik_t | |
source_not_independent_t | |
new_iks_t | |
target_not_dependent_t | |
momrf_op_t | |
distf_op_t | |
edge_address_t | |
GMPI | |
buffer_t | |
comm_ref_t | |
Comm | |
Intracomm | |
xaifBoosterCrossCountryInterface |