Graph Drawing Toolkit
| adj_border_steps(face f) const | plan_undi_graph | |
| adj_edges(gdtnode v) const | plan_undi_graph | |
| adj_edges(face f, gdtnode v=NULL_NODE) const | plan_undi_graph | |
| adj_face(face f, gdtedge e) const | plan_undi_graph | |
| adj_faces(gdtnode v) const | plan_undi_graph | |
| adj_nodes(face f) const | plan_undi_graph | |
| undi_graph::adj_nodes(gdtnode v) const | undi_graph | |
| adj_pred(gdtedge e, gdtnode v) const | plan_undi_graph | |
| adj_pred(gdtedge e, face f) const | plan_undi_graph | |
| adj_succ(gdtedge e, gdtnode v) const | plan_undi_graph | |
| adj_succ(gdtedge e, face f) const | plan_undi_graph | |
| all_constraints() const | undi_graph | |
| all_edges() const | undi_graph | |
| all_edges_are_directed() const | undi_graph | |
| all_faces() const | plan_undi_graph | |
| all_nodes() const | undi_graph | |
| angle_of_border_step(border_step s) const | orth_plan_undi_graph | |
| angle_on_node(gdtnode v, face f) const | dime_orth_plan_undi_graph | |
| angle_required_to_change_heading(heading_type initial, heading_type final) | dime_orth_plan_undi_graph | [static] |
| append_section_to_fstream(std::ofstream &out) | undi_graph | |
| apply_layout_algorithm(bool err_mess=true) | orth_plan_undi_graph | |
| assign_id(gdtnode v, int new_id=AUTO_ID) | plan_undi_graph | |
| assign_id(gdtedge e, int new_id=AUTO_ID) | plan_undi_graph | |
| assign_id(face f, int new_id=AUTO_ID) | plan_undi_graph | |
| undi_graph::assign_id(constraint c, int new_id=AUTO_ID) | undi_graph | |
| attach_nodes_by_chain(gdtnode v1, gdtnode v2, gdt::gdtlist< gdtnode > &N) | dime_orth_plan_undi_graph | |
| bend_standard_deviation() const | orth_plan_undi_graph | |
| bends_of_border_step(border_step s) const | orth_plan_undi_graph | |
| biconnected_components(gdtnode v, gdt::gdtnode_map< dfs_node_info * > &vettore_nodi, gdt::gdtlist< undi_graph * > &bic) const | undi_graph | |
| bm_preprocessing(bm_node_info node_vector[], gdt::gdtlist< gdtedge > &added_edges, gdtnode root, bic_obj_node *IMM[], bool reached[], bool e_reached[], gdtedge iterator[], int &nodes_in_component, gdtnode graph_nodes[], bic_obj *&bic_obj_actual_pointer, bic_obj_node *&bic_obj_node_actual_pointer) | undi_graph | |
| bm_spanning_tree(bm_node_info node_vector[], gdt::gdtlist< gdtedge > &added_edges, bic_obj_node *IMM[], gdtnode v, bool reached[], bool e_reached[], gdtedge iterator[], gdtnode graph_nodes[], int &nodes_in_component, bic_obj *&bic_obj_actual_pointer, bic_obj_node *&bic_obj_node_actual_pointer) | undi_graph | |
| border_distance(gdtnode v1, gdtnode v2, face f) const | dime_orth_plan_undi_graph | |
| border_distance(gdtnode v, gdtedge e, face f) const | dime_orth_plan_undi_graph | |
| border_distance(gdtedge e, gdtnode v, face f) const | dime_orth_plan_undi_graph | |
| border_distance(gdtedge e1, gdtedge e2, face f) const | dime_orth_plan_undi_graph | |
| border_is_closed(face f) const | orth_plan_undi_graph | |
| border_step_goes_straight(border_step s) const | orth_plan_undi_graph | |
| border_step_moving_along_edge(gdtedge e, gdtnode v) const | plan_undi_graph | |
| border_step_sequence(border_step s1, border_step s2) const | plan_undi_graph | |
| border_step_sequence(border_step s1, border_step s2, gdt::gdtlist< border_step > &L) const | plan_undi_graph | |
| border_step_sequence(gdtnode v1, gdtnode v2, face f) const | plan_undi_graph | |
| border_step_sequence(gdtnode v1, gdtnode v2, face f, gdt::gdtlist< border_step > &L) const | plan_undi_graph | |
| border_step_turns_back(border_step s) const | orth_plan_undi_graph | |
| border_step_turns_left(border_step s) const | orth_plan_undi_graph | |
| border_step_turns_right(border_step s) const | orth_plan_undi_graph | |
| border_steps_starting_at_node(gdtnode v) const | plan_undi_graph | |
| boyer(gdtnode root) | undi_graph | |
| build_embedded_posets(plan_undi_graph &pug_v, plan_undi_graph &pug_h, gdt::gdtnode_map< gdtnode > &node_in_pug_v, gdt::gdtnode_map< gdtnode > &node_in_pug_h) | dime_orth_plan_undi_graph | |
| build_mapping_edge_to_edge_with_undi_graph(const undi_graph &ug, gdt::gdtedge_map< gdtedge > &edge_corr_in_ug) const | undi_graph | |
| build_mapping_node_to_node_with_undi_graph(const undi_graph &ug, gdt::gdtnode_map< gdtnode > &node_corr_in_ug) const | undi_graph | |
| calculate_dual(plan_undi_graph &, gdt::gdtmap< face, gdtnode > &) | plan_undi_graph | [protected] |
| calculate_dual(plan_undi_graph &, gdtedge, gdt::gdtmap< face, gdtnode > &) | plan_undi_graph | [protected] |
| calculate_level_of_all_nodes(gdt::gdtnode_array< int > &levels_buffer) | undi_graph | |
| calculate_level_of_node(gdtnode v, gdt::gdtnode_array< int > &levels_buffer) | undi_graph | |
| clear() | dime_orth_plan_undi_graph | |
| compare(gdtnode v, gdtnode w, gdt::gdtnode_array< int > &f, compare_option co=MIN) const | undi_graph | |
| compare_embedding(undi_graph &ug) | undi_graph | |
| complex_DFS(gdtnode v, gdtedge e, gdt::gdtnode_array< bool > &reached, gdt::gdtnode_array< gdtedge > &father, gdt::gdtlist< gdtnode > &order, gdt::gdtnode_array< gdtnode > &lowpt1, gdt::gdtnode_array< gdtnode > &lowpt2, gdt::gdtnode_array< int > &num_succ, bool &root_is_articulated) const | undi_graph | |
| compute_dime_with_expanded_nodes(gdt::gdtnode_array< int > &w, gdt::gdtnode_array< int > &h, dime_orth_plan_undi_graph &dopug, gdt::gdtnode_map< gdtnode > &super_node) const | dime_orth_plan_undi_graph | |
| compute_dime_with_expanded_nodes_and_edges_centered(gdt::gdtnode_array< int > &w, gdt::gdtnode_array< int > &h, dime_orth_plan_undi_graph &dopug, gdt::gdtnode_map< gdtnode > &super_node) const | dime_orth_plan_undi_graph | |
| compute_dime_with_expanded_nodes_and_pins(const gdt::gdtnode_array< int > &w, const gdt::gdtnode_array< int > &h, dime_orth_plan_undi_graph &dopug, gdt::gdtnode_map< gdtnode > &super_node) const | dime_orth_plan_undi_graph | |
| compute_visibility_representation(gdt::gdtnode_array< horizontal_segment > &seg_node, gdt::gdtedge_array< vertical_segment > &seg_edge, face ext_face, bool compacted=false, gdt::gdtedge_array< int > *cp=NULL) | plan_undi_graph | |
| compute_visibility_representation(gdt::gdtnode_array< horizontal_segment > &seg_node, gdt::gdtedge_array< vertical_segment > &seg_edge, gdtedge e_st, bool compacted=false, gdt::gdtedge_array< int > *cp=NULL) | plan_undi_graph | |
| connected_components(gdt::gdtnode_array< int > &component) const | undi_graph | |
| constraints_on_edge(gdtedge e) | undi_graph | |
| constraints_on_node(gdtnode v) | undi_graph | |
| contract(gdtedge e) | plan_undi_graph | |
| contract() | plan_undi_graph | |
| copy_constraints_from_subgraph_of_undi_graph(gdt::gdtlist< gdtedge > &sub, undi_graph &ug) | undi_graph | [protected] |
| corresponding_border_step(border_step s, const plan_undi_graph &pug) | plan_undi_graph | |
| corresponding_constraint(constraint c, const undi_graph &ug) const | undi_graph | |
| corresponding_edge(gdtedge e, const undi_graph &ug) const | undi_graph | |
| corresponding_face(face f, const plan_undi_graph &pug) | plan_undi_graph | |
| corresponding_node(gdtnode v, const undi_graph &ug) const | undi_graph | |
| cost_of_last_algorithm() const | orth_plan_undi_graph | |
| count_not_dummy_nodes() const | undi_graph | [protected] |
| create_bicomp(gdtnode root, bm_node_info node_vector[], gdt::gdtnode_map< bic_obj_node * > &IMM) | undi_graph | |
| create_children_ordered(bm_node_info node_vector[], gdtnode graph_nodes[], int nodes_in_component) | undi_graph | |
| create_out_back_edges_ordered(bm_node_info node_vector[]) | undi_graph | |
| cyclic_adj_pred(gdtedge e, gdtnode v) const | plan_undi_graph | |
| cyclic_adj_pred(gdtedge e, face f) const | plan_undi_graph | |
| cyclic_adj_succ(gdtedge e, gdtnode v) const | plan_undi_graph | |
| cyclic_adj_succ(gdtedge e, face f) const | plan_undi_graph | |
| cyclic_in_pred(gdtedge e, gdtnode v) | undi_graph | |
| cyclic_in_succ(gdtedge e, gdtnode v) | undi_graph | |
| cyclic_out_pred(gdtedge e, gdtnode v) | undi_graph | |
| cyclic_out_succ(gdtedge e, gdtnode v) | undi_graph | |
| cyclic_pred_border_step(border_step s) const | plan_undi_graph | |
| cyclic_succ_border_step(border_step s) const | plan_undi_graph | |
| DD_dynamic_attach_vertex(gdtnode n) | dime_orth_plan_undi_graph | |
| DD_dynamic_new_edge(gdtnode v1, gdtnode v2, int cross_cost, int bend_cost, int length_unit_cost) | dime_orth_plan_undi_graph | |
| decompose_all_faces_into_smaller_rectangular_faces(gdt::gdtlist< gdtnode > &N, gdt::gdtlist< gdtedge > &E) | orth_plan_undi_graph | |
| degree(gdtnode v) const | plan_undi_graph | |
| degree(face f, bool bridge=false) const | plan_undi_graph | |
| degree_in(gdtnode v) const | undi_graph | |
| degree_out(gdtnode v) const | undi_graph | |
| del_all_constraints() | undi_graph | |
| del_all_constraints_involving_edge(gdtedge e) | undi_graph | |
| del_all_constraints_involving_node(gdtnode v) | undi_graph | |
| del_constraint(constraint c) | undi_graph | |
| del_constraints_type(constraint_type ct) | undi_graph | |
| del_constraints_type_involving_edge(constraint_type ct, gdtedge e) | undi_graph | |
| del_constraints_type_involving_node(constraint_type ct, gdtnode v) | undi_graph | |
| del_edge(gdtedge e) | dime_orth_plan_undi_graph | |
| del_node(gdtnode v) | dime_orth_plan_undi_graph | |
| destroy_bicomp(gdt::gdtlist< bic_obj * > &bic_obj_created) | undi_graph | |
| dime_orth_plan_undi_graph() | dime_orth_plan_undi_graph | |
| dime_orth_plan_undi_graph(const undi_graph &ug, algorithm_type alg=SLOW_COMPACTION) | dime_orth_plan_undi_graph | |
| dime_orth_plan_undi_graph(const undi_graph &ug, algorithm_type alg, int &num_irr_faces) | dime_orth_plan_undi_graph | |
| dime_orth_plan_undi_graph(const plan_undi_graph &pug, algorithm_type alg=SLOW_COMPACTION) | dime_orth_plan_undi_graph | |
| dime_orth_plan_undi_graph(const plan_undi_graph &pug, algorithm_type alg, int &numm_irr_faces) | dime_orth_plan_undi_graph | |
| dime_orth_plan_undi_graph(const orth_plan_undi_graph &opug, algorithm_type alg=SLOW_COMPACTION) | dime_orth_plan_undi_graph | |
| dime_orth_plan_undi_graph(const orth_plan_undi_graph &opug, algorithm_type alg, heading_type dir) | dime_orth_plan_undi_graph | |
| dime_orth_plan_undi_graph(const orth_plan_undi_graph &opug, algorithm_type alg, heading_type dir, int &num_irr_faces) | dime_orth_plan_undi_graph | |
| dime_orth_plan_undi_graph(const dime_orth_plan_undi_graph &dopug) | dime_orth_plan_undi_graph | |
| disable_diagnostic_printouts() | orth_plan_undi_graph | |
| disable_keep_ordering_of_directed_edges() | undi_graph | |
| edge_belongs_to_face(gdtedge e, face f) const | plan_undi_graph | |
| edge_is_directed(gdtedge e) const | undi_graph | |
| edge_is_dummy(gdtedge) const | dime_orth_plan_undi_graph | |
| edge_is_real(gdtedge) const | dime_orth_plan_undi_graph | |
| edge_of_border_step(border_step s) const | plan_undi_graph | |
| edges_entering_node_while_moving_around_face(gdtnode v, face f) const | plan_undi_graph | |
| edges_on_each_side_of_node(gdtnode v, gdt::gdtlist< gdtedge > &L1, gdt::gdtlist< gdtedge > &L2, gdt::gdtlist< gdtedge > &L3, gdt::gdtlist< gdtedge > &L4) const | orth_plan_undi_graph | |
| edges_shared_by_faces(face f1, face f2) const | plan_undi_graph | |
| edges_with_extremal_nodes(gdtnode v1, gdtnode v2) const | undi_graph | |
| enable_diagnostic_printouts() | orth_plan_undi_graph | |
| enable_keep_ordering_of_directed_edges() | undi_graph | |
| expand(gdtnode v, gdtedge e_init, gdtedge e_end) | plan_undi_graph | |
| extended_kplanarity(gdtnode n) | undi_graph | |
| extended_kplanarity(gdt::gdtnode_map< int > &kplan) | undi_graph | |
| external_face() const | orth_plan_undi_graph | |
| face_is_regular(face f, border_step &r1, border_step &r2) const | orth_plan_undi_graph | |
| face_of_border_step(border_step s) const | plan_undi_graph | |
| face_visible_from_node_looking_with_heading(gdtnode v, heading_type h) const | dime_orth_plan_undi_graph | |
| faces_shared_by_separation_pair(separation_pair sp) const | plan_undi_graph | |
| find_adj_edges_marked_as(gdtnode v, marker_type m) const | undi_graph | |
| find_adj_edges_not_marked_as(gdtnode v, marker_type m) const | undi_graph | |
| find_border_step_turning_left(gdt::gdtlist< border_step > &bsl, gdt::list_item start_pos=NULL) const | orth_plan_undi_graph | |
| find_border_step_turning_left_or_turning_back(gdt::gdtlist< border_step > &bs, gdt::list_item start_pos=NULL) const | orth_plan_undi_graph | |
| find_border_step_turning_right(gdt::gdtlist< border_step > &bs, gdt::list_item start_pos=NULL) const | orth_plan_undi_graph | |
| find_constraint(int id) const | undi_graph | |
| find_directed_edge(gdtnode v1, gdtnode v2) | undi_graph | |
| find_edge(int id) const | undi_graph | |
| find_edge(gdtnode v1, gdtnode v2) const | undi_graph | |
| find_edge_leaving_node_with_heading(gdtnode v, heading_type d) const | dime_orth_plan_undi_graph | |
| find_edges_marked_as(marker_type m) const | undi_graph | |
| find_face(int ref_id) const | plan_undi_graph | |
| find_first_edge_marked_as(marker_type m) const | undi_graph | |
| find_first_node_marked_as(marker_type m) const | undi_graph | |
| find_in_edges_marked_as(gdtnode v, marker_type m) const | undi_graph | |
| find_node(int id) const | undi_graph | |
| find_node_after_edge_along_heading(gdtedge e, heading_type h) | dime_orth_plan_undi_graph | |
| find_node_reachable_moving_from_node_with_heading(gdtnode v, heading_type d) const | dime_orth_plan_undi_graph | |
| find_node_reachable_moving_from_node_with_heading(gdtnode v, heading_type d, gdtedge &e) const | dime_orth_plan_undi_graph | |
| find_nodes_marked_as(marker_type m) const | undi_graph | |
| find_out_edges_marked_as(gdtnode v, marker_type m) const | undi_graph | |
| find_separation_pair(int idv1, int idv2, const gdt::gdtlist< separation_pair > &sp_list) const | plan_undi_graph | |
| find_separation_pairs() const | plan_undi_graph | |
| first_adj_edge(gdtnode v) const | plan_undi_graph | |
| first_adj_edge(face f) const | plan_undi_graph | |
| first_border_step(face f) const | plan_undi_graph | |
| first_constraint() const | undi_graph | |
| first_edge() const | undi_graph | |
| first_face() const | plan_undi_graph | |
| first_in_edge(gdtnode v) | undi_graph | |
| first_node() const | undi_graph | |
| first_node_visited_while_moving_on_edge_around_face(gdtedge, face) const | plan_undi_graph | [protected] |
| first_out_edge(gdtnode v) | undi_graph | |
| forget() | dime_orth_plan_undi_graph | |
| generate_biconnected(int n, double prob_iv, int k=INFINITE, bool multiple=true) | plan_undi_graph | |
| generate_constraint_id() | undi_graph | |
| generate_edge_id() | undi_graph | |
| generate_face_id() | plan_undi_graph | |
| generate_node_id() | undi_graph | |
| generate_plan_biconnected(int n, double prob_iv, int k=INFINITE, bool multiple=true) | undi_graph | |
| get_constraint_on_bends_of_edge(gdtedge e) const | orth_plan_undi_graph | |
| get_diagnostic_printouts_are_enabled() const | orth_plan_undi_graph | |
| get_layout_algorithm() const | orth_plan_undi_graph | |
| get_local_consistency_is_suspended() const | orth_plan_undi_graph | |
| get_max_constraint_id() const | undi_graph | |
| get_max_edge_id() const | undi_graph | |
| get_max_face_id() const | plan_undi_graph | [inline] |
| get_max_node_id() const | undi_graph | |
| get_ref_border_step() const | orth_plan_undi_graph | |
| heading_after_bend(heading_type d, bend_type b) const | dime_orth_plan_undi_graph | |
| heading_after_bend_sequence(heading_type d, gdt::gdtlist< bend_type > bl) const | dime_orth_plan_undi_graph | |
| heading_after_border_step(border_step s) const | dime_orth_plan_undi_graph | |
| heading_after_inversion(heading_type d) const | dime_orth_plan_undi_graph | |
| heading_after_rotation(heading_type d, angle_type a) | dime_orth_plan_undi_graph | [static] |
| heading_after_rotation_around_bend(heading_type d, angle_type a) const | dime_orth_plan_undi_graph | |
| id(gdtnode v) const | plan_undi_graph | |
| id(gdtedge e) const | plan_undi_graph | |
| id(face f) const | plan_undi_graph | |
| undi_graph::id(constraint c) const | undi_graph | |
| in_edges(gdtnode v) | undi_graph | |
| in_pred(gdtedge e, gdtnode v) | undi_graph | |
| in_succ(gdtedge e, gdtnode v) | undi_graph | |
| initial_heading_of_border_step(border_step s) const | dime_orth_plan_undi_graph | |
| inline_distance(gdtnode v1, gdtnode v2, slope_type slope) const | dime_orth_plan_undi_graph | |
| inline_distance(gdtnode v, gdtedge e) const | dime_orth_plan_undi_graph | |
| inline_distance(gdtedge e1, gdtedge e2) const | dime_orth_plan_undi_graph | |
| internal_consistency_check() const | plan_undi_graph | |
| is_acyclic() const | undi_graph | |
| is_biconnected() const | undi_graph | |
| is_candidate(gdtnode v) const | undi_graph | |
| is_candidate() const | undi_graph | |
| is_connected() const | undi_graph | |
| is_extremal(gdtnode v) const | undi_graph | |
| is_extremal(gdtnode v, gdtedge e) const | undi_graph | |
| is_internal(gdtnode v) const | undi_graph | |
| is_internal(gdtnode v, gdtedge e) const | undi_graph | |
| is_marked(gdtnode v, marker_type m) const | undi_graph | |
| is_marked(gdtedge e, marker_type m) const | undi_graph | |
| is_multiple(gdtedge e) const | undi_graph | |
| is_orthogonal() | orth_plan_undi_graph | |
| is_planar() | undi_graph | |
| is_source(gdtnode v) const | undi_graph | |
| is_st_digraph(gdtnode &s, gdtnode &t) | undi_graph | |
| is_target(gdtnode v) const | undi_graph | |
| kplanarity(gdtnode n) | undi_graph | |
| kplanarity(gdt::gdtnode_map< int > &kplan) | undi_graph | |
| last_adj_edge(gdtnode v) const | plan_undi_graph | |
| last_adj_edge(face f) const | plan_undi_graph | |
| last_border_step(face f) const | plan_undi_graph | |
| last_constraint() const | undi_graph | |
| last_edge() const | undi_graph | |
| last_face() const | plan_undi_graph | |
| last_in_edge(gdtnode v) | undi_graph | |
| last_node() const | undi_graph | |
| last_out_edge(gdtnode v) | undi_graph | |
| left_face_moving_along_edge(gdtedge e, gdtnode v) const | plan_undi_graph | |
| left_thickness_of_edge(gdtedge e, gdtnode v) const | orth_plan_undi_graph | |
| length_of_edge(gdtedge e) const | dime_orth_plan_undi_graph | |
| local_get(bool &p1, heading_type &p2, gdt::gdtnode_map< struct_dime_node_info > *&p3, gdt::gdtedge_map< struct_dime_edge_info > *&p4, gdt::gdtmap< border_step, struct_dime_border_step_info > *&p5) | dime_orth_plan_undi_graph | |
| orth_plan_undi_graph::local_get(face &p1, algorithm_type &p2, gdt::gdtedge_map< bend_constraint > &p3, gdt::gdtmap< border_step, struct_orth_border_step_info > *&p4, bool &p5, bool &p6, border_step &p7, int p8) | orth_plan_undi_graph | |
| plan_undi_graph::local_get(gdt::gdtlist< face > *&p1, gdt::gdtedge_map< struct_plan_edge_info > *&p2, gdt::gdtmap< int, face > *&p3, int &p4, int &p5) | plan_undi_graph | |
| undi_graph::local_get(gdt::gdtlist< gdtnode > *&p, gdt::gdtlist< gdtedge > *&p0, gdt::gdtnode_map< struct_undi_node_info > *&p2, gdt::gdtedge_map< struct_undi_edge_info > *&p3, gdt::gdtlist< constraint > *&p4, gdt::gdtmap< int, gdtnode > *&p5, gdt::gdtmap< int, gdtedge > *&p6, gdt::gdtmap< int, constraint > *&p7, int &p8, int &p9, int &p10, bool &p11) | undi_graph | |
| make_biconnected() | undi_graph | |
| make_connected() | undi_graph | |
| make_directed(gdtedge e, gdtnode v) | undi_graph | |
| make_directed(bool randomly=false) | undi_graph | |
| make_directed(gdtnode s, gdtnode t) | undi_graph | |
| make_dual(plan_undi_graph &dual_pug, gdt::gdtmap< face, gdtnode > &primal_face_2_dual_node, gdt::gdtmap< gdtnode, face > &dual_node_2_primal_face, gdt::gdtmap< gdtedge, gdtedge > &primal_edge_2_dual_edge, gdt::gdtmap< gdtedge, gdtedge > &dual_edge_2_primal_edge) const | plan_undi_graph | |
| make_embedding_as(const plan_undi_graph &pug) | plan_undi_graph | |
| undi_graph::make_embedding_as(const undi_graph &ug) | undi_graph | |
| make_embedding_cand(gdtnode v) | undi_graph | |
| make_embedding_cand() | undi_graph | |
| make_embedding_cand_expanded() | undi_graph | |
| make_embedding_cand_planar() | undi_graph | |
| make_embedding_planar() | undi_graph | |
| make_embedding_planar_boyer() | undi_graph | |
| make_max_degree(int d) | undi_graph | |
| make_planar_embedding(bm_node_info node_vector[], bic_obj_node *IMM[], gdtnode root, bool edge_to_be_inserted[], int flip[], bic_obj *&bic_obj_actual_pointer) | undi_graph | |
| make_simple() | plan_undi_graph | |
| make_sink(gdtnode v) | undi_graph | |
| make_source(gdtnode v) | undi_graph | |
| make_undirected(gdtedge e) | undi_graph | |
| make_undirected() | undi_graph | |
| make_upward_embedding(face ext_face, gdt::gdtnode_array< gdtedge > &fe, int minimum_switches=0) | plan_undi_graph | |
| mark(gdtnode v, marker_type m) | undi_graph | |
| mark(gdtedge e, marker_type m) | undi_graph | |
| mark(gdtnode v, gdt::gdtlist< marker_type > ml) | undi_graph | |
| mark(gdtedge e, gdt::gdtlist< marker_type > ml) | undi_graph | |
| markers(gdtnode v) const | undi_graph | |
| markers(gdtedge e) const | undi_graph | |
| max_degree() const | undi_graph | |
| max_number_of_bends_on_edge() const | orth_plan_undi_graph | |
| mean_number_of_bends_on_edge() const | orth_plan_undi_graph | |
| merge_biconnected(gdt::gdtlist< undi_graph * > &bic) | undi_graph | |
| merge_edges_on_same_side(gdtnode v) | orth_plan_undi_graph | [protected] |
| min_border_distance(gdtnode v1, gdtnode v2, face f, bool &ordered) const | dime_orth_plan_undi_graph | |
| min_border_distance(gdtnode v, gdtedge e, face f, bool &ordered) const | dime_orth_plan_undi_graph | |
| min_border_distance(gdtedge e1, gdtedge e2, face f, bool &ordered) const | dime_orth_plan_undi_graph | |
| min_degree() const | undi_graph | |
| minimal_bend_sequence_required_to_change_heading(heading_type i, heading_type f) const | dime_orth_plan_undi_graph | |
| mirror(dime_orth_plan_undi_graph &dopug) | dime_orth_plan_undi_graph | |
| orth_plan_undi_graph::mirror(orth_plan_undi_graph &opug) | orth_plan_undi_graph | |
| plan_undi_graph::mirror(plan_undi_graph &pug) | plan_undi_graph | |
| undi_graph::mirror(undi_graph &ug) | undi_graph | |
| new_constraint(constraint c) | undi_graph | |
| new_constraint_angle_sweep(gdtnode rn, gdtedge re, angle_type alpha, int new_id=AUTO_ID) | undi_graph | |
| new_constraint_bend_direction_on_edge(gdtedge e, gdtnode v, int new_id=AUTO_ID) | undi_graph | |
| new_constraint_edge_attachment_wrt_previous_corner(gdtnode rn, gdtedge re, int value, int new_id=AUTO_ID) | undi_graph | |
| new_constraint_min_tieing(int value, int new_id=AUTO_ID) | undi_graph | |
| new_constraint_node_height(gdtnode n, double x, int new_id=AUTO_ID) | undi_graph | |
| new_constraint_node_width(gdtnode n, double x, int new_id=AUTO_ID) | undi_graph | |
| new_constraint_number_of_bends_on_edge(gdtedge e, bend_constraint b, int new_id=AUTO_ID) | undi_graph | |
| new_constraint_same_face_node(gdtnode v, int face_label, int new_id=AUTO_ID) | undi_graph | |
| new_constraint_same_face_node(gdt::gdtlist< gdtnode > Ln, int face_label) | undi_graph | |
| new_constraint_same_face_ordered_nodes(gdt::gdtlist< gdtnode > Ln, int new_id=AUTO_ID) | undi_graph | |
| new_constraint_uncrossable_edge(gdtedge e, int new_id=AUTO_ID) | undi_graph | |
| new_edge(gdtnode v, gdtnode w, face f, int new_id=AUTO_ID) | dime_orth_plan_undi_graph | |
| new_edge(gdtnode v, gdtedge ev, gdtnode w, gdtedge ew, int new_id=AUTO_ID) | dime_orth_plan_undi_graph | |
| undi_graph::new_edge(gdtnode v1, gdtedge e1, gdtnode v2, int new_id=AUTO_ID, int dir=gdt::after) | undi_graph | |
| undi_graph::new_edge(gdtnode v1, gdtedge e1, gdtnode v2, gdtedge e2, int new_id=AUTO_ID, int dir=gdt::after) | undi_graph | |
| new_node(gdtedge e, int new_id=AUTO_ID) | dime_orth_plan_undi_graph | |
| new_node(gdtedge e, gdtnode v, int dist, int new_id=AUTO_ID) | dime_orth_plan_undi_graph | |
| new_node(gdtnode v, heading_type dir, int dist, int new_node_id=AUTO_ID, int new_edge_id=AUTO_ID) | dime_orth_plan_undi_graph | |
| orth_plan_undi_graph::new_node(gdtnode v, gdtedge e, angle_type alpha, int new_node_id=AUTO_ID, int new_edge_id=AUTO_ID) | orth_plan_undi_graph | |
| plan_undi_graph::new_node(gdtnode n, gdtedge e, int node_id=AUTO_ID, int edge_id=AUTO_ID) | plan_undi_graph | |
| undi_graph::new_node(gdt::gdtlist< gdtnode > L, int new_id=AUTO_ID) | undi_graph | |
| new_straight_edge(gdtnode v, gdtnode w, int new_id=AUTO_ID) | dime_orth_plan_undi_graph | |
| node_belongs_to_edge(gdtnode v, gdtedge e) const | undi_graph | |
| node_belongs_to_face(gdtnode v, face f) const | plan_undi_graph | |
| node_between_adj_edges(gdtedge e1, gdtedge e2) const | undi_graph | |
| node_is_dummy(gdtnode) const | dime_orth_plan_undi_graph | |
| node_is_flat(gdtnode v) const | orth_plan_undi_graph | |
| node_is_real(gdtnode) const | dime_orth_plan_undi_graph | |
| nodes_and_edges() const | undi_graph | |
| nodes_reachable_moving_from_node_with_slope(gdtnode v, slope_type slope) const | dime_orth_plan_undi_graph | |
| nodes_reachable_moving_from_node_with_slope(gdtnode v, slope_type slope, gdt::gdtlist< gdtedge > &edge_chain) const | dime_orth_plan_undi_graph | |
| nodes_shared_by_faces(face f1, face f2) const | plan_undi_graph | |
| number_of_bends() const | orth_plan_undi_graph | |
| number_of_bends(gdtedge e) const | orth_plan_undi_graph | |
| number_of_bends(gdt::gdtlist< gdtedge > ls_edge) const | orth_plan_undi_graph | |
| number_of_bends(border_step s) const | orth_plan_undi_graph | |
| number_of_constraints() const | undi_graph | |
| number_of_cross_nodes() const | plan_undi_graph | |
| number_of_edges() const | undi_graph | |
| number_of_extremals() const | undi_graph | |
| number_of_faces() const | plan_undi_graph | |
| number_of_left_bends(border_step s) const | orth_plan_undi_graph | |
| number_of_left_turns_along_border(border_step sv, border_step sw) const | orth_plan_undi_graph | |
| number_of_left_turns_around_face(face f) const | orth_plan_undi_graph | |
| number_of_nodes() const | undi_graph | |
| number_of_right_bends(border_step s) const | orth_plan_undi_graph | |
| number_of_right_turns_along_border(border_step sv, border_step sw) const | orth_plan_undi_graph | |
| number_of_right_turns_around_face(face f) const | orth_plan_undi_graph | |
| one_dimensional_tieing(const gdt::gdtmap< int, int > &min, const gdt::gdtmap< int, int > &max, const gdt::gdtmap< int, int > &cost, slope_type slp, unsigned int min_tieing_dist=1) | dime_orth_plan_undi_graph | |
| one_dimensional_tieing_for_expanded_nodes(const gdt::gdtmap< int, int > &min, const gdt::gdtmap< int, int > &max, const gdt::gdtmap< int, int > &cost, slope_type slp, const gdt::gdtmap< int, int > &extent, unsigned int min_tieing_dist=1) | dime_orth_plan_undi_graph | |
| operator=(const undi_graph &ug) | dime_orth_plan_undi_graph | |
| operator=(const plan_undi_graph &pug) | dime_orth_plan_undi_graph | |
| operator=(const orth_plan_undi_graph &opug) | dime_orth_plan_undi_graph | |
| operator=(const dime_orth_plan_undi_graph &dopug) | dime_orth_plan_undi_graph | |
| orth_plan_undi_graph::operator=(const upwa_plan_undi_graph &upug) | orth_plan_undi_graph | |
| opposite(gdtnode v, gdtedge e) const | undi_graph | [inline] |
| opposite_border_step(border_step s) const | plan_undi_graph | |
| opposite_slope(slope_type s) const | dime_orth_plan_undi_graph | |
| orth_plan_undi_graph() | orth_plan_undi_graph | |
| orth_plan_undi_graph(const undi_graph &ug, algorithm_type alg=PLAN_ORTH_OPTIMAL, bool err_mess=true) | orth_plan_undi_graph | |
| orth_plan_undi_graph(const plan_undi_graph &pug, algorithm_type alg=PLAN_ORTH_OPTIMAL, bool err_mess=true) | orth_plan_undi_graph | |
| orth_plan_undi_graph(const plan_undi_graph &pug, face ef, algorithm_type alg=PLAN_ORTH_OPTIMAL, bool err_mess=true) | orth_plan_undi_graph | |
| orth_plan_undi_graph(const upwa_plan_undi_graph &upug, algorithm_type alg=PLAN_ORTH_UPWA_STRAIGHT_MIDDLE) | orth_plan_undi_graph | |
| orth_plan_undi_graph(const orth_plan_undi_graph &opug) | orth_plan_undi_graph | |
| out_edges(gdtnode v) | undi_graph | |
| out_pred(gdtedge e, gdtnode v) | undi_graph | |
| out_succ(gdtedge e, gdtnode v) | undi_graph | |
| path_corresponding_to_edge(gdtedge, undi_graph &) const | undi_graph | [protected] |
| pin_number_of_border_step(border_step s) const | orth_plan_undi_graph | |
| plan_undi_graph() | plan_undi_graph | |
| plan_undi_graph(const undi_graph &ug, planarize_options po=DO_NOT_PRESERVE_EMBEDDING, bool err_mess=true) | plan_undi_graph | |
| plan_undi_graph(const plan_undi_graph &pug) | plan_undi_graph | |
| plan_with_fixed_face_of_undi_graph(undi_graph &ug, gdtedge start_edge, gdtnode start_node) | plan_undi_graph | |
| planarize(planarize_options po=DO_NOT_PRESERVE_EMBEDDING) | undi_graph | |
| pos_in_border(gdtedge e, face f) const | plan_undi_graph | |
| pos_in_border(border_step s) const | plan_undi_graph | |
| pos_of_edge_in_adj_edges_of_node(gdtedge e, gdtnode v) const | undi_graph | |
| position_of_bends_along_edge(gdtedge e, gdtnode v) const | dime_orth_plan_undi_graph | |
| position_of_edge_with_respect_to_node(gdtedge e, gdtnode v) const | dime_orth_plan_undi_graph | |
| position_of_node(gdtnode v) const | dime_orth_plan_undi_graph | |
| position_of_node_with_respect_to_edge(gdtnode v, gdtedge e) const | dime_orth_plan_undi_graph | |
| position_of_node_with_respect_to_node(gdtnode v1, gdtnode v2) const | dime_orth_plan_undi_graph | |
| pred_border_step(border_step s) const | plan_undi_graph | |
| pred_constraint(constraint c) const | undi_graph | |
| pred_edge(gdtedge e) const | undi_graph | |
| pred_face(face f) const | plan_undi_graph | |
| pred_node(gdtnode v) const | undi_graph | |
| print(print_mode mode=BY_FACES, std::ostream &os=std::cout) const | dime_orth_plan_undi_graph | |
| print(gdtnode v, std::ostream &os=std::cout) const | dime_orth_plan_undi_graph | |
| print(gdtedge e, bool path=false, std::ostream &os=std::cout) const | dime_orth_plan_undi_graph | |
| print(face f, std::ostream &os=std::cout) const | dime_orth_plan_undi_graph | |
| orth_plan_undi_graph::print(gdtedge e, std::ostream &os=std::cout) const | orth_plan_undi_graph | |
| orth_plan_undi_graph::print(constraint c, std::ostream &os=std::cout) const | orth_plan_undi_graph | |
| orth_plan_undi_graph::print(separation_pair sp, std::ostream &os=std::cout) const | orth_plan_undi_graph | |
| print_constraints(std::ostream &os=std::cout) const | undi_graph | |
| print_constraints_on_edge(gdtedge e, std::ostream &os=std::cout) | undi_graph | |
| print_constraints_on_node(gdtnode v, std::ostream &os=std::cout) | undi_graph | |
| quick_minimum_spanning_tree(gdt::gdtedge_map< int > weights, gdt::gdtlist< gdtedge > &span_edges) | undi_graph | |
| read(std::string file_name) | undi_graph | |
| read_section_from_fstream(std::ifstream &in) | undi_graph | |
| regularize_all_faces(gdt::gdtlist< gdtnode > &N, gdt::gdtlist< gdtedge > &E, algorithm_type alg) | orth_plan_undi_graph | |
| remove_all_dummy_nodes_and_edges() | dime_orth_plan_undi_graph | |
| replace_bend_with_node(gdtedge e, gdtnode v, int pos, gdt::gdtlist< gdtnode > &N, gdt::gdtlist< gdtedge > &E) | dime_orth_plan_undi_graph | |
| replace_bends_with_nodes(gdtedge e, gdt::gdtlist< gdtnode > &N, gdt::gdtlist< gdtedge > &E) | dime_orth_plan_undi_graph | |
| replace_bends_with_nodes(face f, gdt::gdtlist< gdtnode > &N, gdt::gdtlist< gdtedge > &E) | dime_orth_plan_undi_graph | |
| replace_bends_with_nodes(gdt::gdtlist< gdtnode > &N, gdt::gdtlist< gdtedge > &E) | dime_orth_plan_undi_graph | |
| replace_edge_with_path(gdtedge e, gdt::gdtlist< int > &node_id_path, gdt::gdtlist< int > &edge_id_path) | undi_graph | |
| replace_edge_with_path_of_graph(gdtedge e, gdt::gdtlist< gdtedge > &edge_path, undi_graph &ug) | undi_graph | |
| replace_node_with_bend(gdtnode v) | dime_orth_plan_undi_graph | |
| restore_local_consistency() | orth_plan_undi_graph | |
| reverse(gdtedge e) | undi_graph | |
| reverse_of_edge(gdtedge e) | undi_graph | |
| right_face_moving_along_edge(gdtedge e, gdtnode v) const | plan_undi_graph | |
| right_thickness_of_edge(gdtedge e, gdtnode v) const | orth_plan_undi_graph | |
| rise_max_constraint_id(int new_max_constraint_id) | undi_graph | |
| rise_max_edge_id(int new_max_edge_id) | undi_graph | |
| rise_max_node_id(int new_max_node_id) | undi_graph | |
| rotation_around_bend_required_to_change_heading(heading_type initial, heading_type final) const | dime_orth_plan_undi_graph | |
| second_node_visited_while_moving_on_edge_around_face(gdtedge, face) const | plan_undi_graph | [protected] |
| separation_pair_pole1(separation_pair sp) const | plan_undi_graph | |
| separation_pair_pole2(separation_pair sp) const | plan_undi_graph | |
| set_external_face(face ef) | orth_plan_undi_graph | |
| set_faces_shared_by_separation_pair(const gdt::gdtlist< face > &, separation_pair) | plan_undi_graph | [protected] |
| set_layout_algorithm(algorithm_type la) | orth_plan_undi_graph | |
| set_reference_border_step(border_step s) | orth_plan_undi_graph | |
| set_reference_border_step(gdtnode v, gdtedge e) | orth_plan_undi_graph | |
| set_separation_pair_pole1(gdtnode, separation_pair) | plan_undi_graph | [protected] |
| set_separation_pair_pole2(gdtnode, separation_pair) | plan_undi_graph | [protected] |
| simple_BFS(gdtnode v, gdt::gdtnode_array< bool > &reached, gdt::gdtnode_array< gdtedge > &father, gdt::gdtnode_array< int > &dist, gdt::gdtlist< gdtnode > &order) const | undi_graph | |
| simple_DFS(gdtnode v, gdt::gdtnode_array< bool > &reached, gdt::gdtnode_array< gdtedge > &father, gdt::gdtlist< gdtnode > &order) const | undi_graph | |
| slope_along_heading(heading_type d) const | dime_orth_plan_undi_graph | |
| slope_of_border_step(border_step s) const | dime_orth_plan_undi_graph | |
| slope_of_edge(gdtedge e) const | dime_orth_plan_undi_graph | |
| source(gdtedge e) const | undi_graph | [inline] |
| spanning_tree(gdt::gdtlist< gdtedge > &spanned_edges, gdt::gdtlist< gdtedge > &unspanned_edges, gdtnode start_node=NULL_NODE) const | undi_graph | |
| split_face_with_shaped_edge(gdtnode v, gdtedge ev, angle_type av, gdtnode w, gdtedge ew, angle_type aw, std::string bends_sequence, int new_id=AUTO_ID) | orth_plan_undi_graph | [protected] |
| split_list_of_edges_on_side(gdt::gdtlist< gdtedge > &L, gdtnode v, gdt::gdtlist< gdtedge > &L_left, gdtedge &ec, gdt::gdtlist< gdtedge > &L_right) | orth_plan_undi_graph | [protected] |
| st_number(gdtedge e_st, gdtnode s, gdt::gdtnode_array< int > &st_num) | undi_graph | |
| star_in_face(face f) | plan_undi_graph | |
| start(gdtedge e) const | undi_graph | [inline] |
| start_of_border_step(border_step s) const | plan_undi_graph | |
| steal_from(undi_graph &ug) | dime_orth_plan_undi_graph | |
| steal_from(plan_undi_graph &pug) | dime_orth_plan_undi_graph | |
| steal_from(orth_plan_undi_graph &opug) | dime_orth_plan_undi_graph | |
| orth_plan_undi_graph::steal_from(undi_graph &ug, algorithm_type alg=PLAN_ORTH_OPTIMAL, bool err_mess=true) | orth_plan_undi_graph | |
| orth_plan_undi_graph::steal_from(plan_undi_graph &pug, algorithm_type alg=PLAN_ORTH_OPTIMAL, bool err_mess=true) | orth_plan_undi_graph | |
| orth_plan_undi_graph::steal_from(plan_undi_graph &pug, face ef, algorithm_type alg=PLAN_ORTH_OPTIMAL, bool err_mess=true) | orth_plan_undi_graph | |
| plan_undi_graph::steal_from(undi_graph &ug, planarize_options po=DO_NOT_PRESERVE_EMBEDDING, bool err_mess=true) | plan_undi_graph | |
| stop(gdtedge e) const | undi_graph | |
| stop_of_border_step(border_step s) const | plan_undi_graph | |
| succ_border_step(border_step s) const | plan_undi_graph | |
| succ_constraint(constraint c) const | undi_graph | |
| succ_edge(gdtedge e) const | undi_graph | |
| succ_face(face f) const | plan_undi_graph | |
| succ_node(gdtnode v) const | undi_graph | |
| suspend_local_consistency() | orth_plan_undi_graph | |
| target(gdtedge e) const | undi_graph | [inline] |
| thickness_of_border_step(border_step s) const | orth_plan_undi_graph | |
| thickness_of_edge(gdtedge e) const | orth_plan_undi_graph | |
| traversal_distance(gdtnode v1, gdtnode v2, slope_type slope) const | dime_orth_plan_undi_graph | |
| traversal_distance(gdtnode v, gdtedge e) const | dime_orth_plan_undi_graph | |
| traversal_distance(gdtedge e1, gdtedge e2) const | dime_orth_plan_undi_graph | |
| turning_border_steps_of_face(face f) const | orth_plan_undi_graph | |
| type_of_constraint(constraint c) const | undi_graph | |
| undi_graph::undi_graph() | undi_graph | |
| undi_graph::undi_graph(const undi_graph &ug) | undi_graph | |
| unmark(gdtnode v, marker_type m) | undi_graph | |
| unmark(gdtedge e, marker_type m) | undi_graph | |
| unmark_all(gdtnode v) | undi_graph | |
| unmark_all(gdtedge e) | undi_graph | |
| unweighted_unoriented_shortest_path(gdtnode start_node, gdtnode end_node, gdt::gdtlist< gdtnode > &nodes, gdt::gdtlist< gdtedge > &edges) const | undi_graph | |
| update_constraints_after_del_edge(gdtedge e) | undi_graph | [protected] |
| update_constraints_after_del_node(gdtnode v) | undi_graph | [protected] |
| update_constraints_after_edge_translation(gdtedge e, gdtnode ve1, gdtnode ve2, gdtedge d, gdtnode vd1, gdtnode vd2) | undi_graph | [protected] |
| update_constraints_after_merge_edges(gdtedge e1, gdtedge e2, gdtedge e) | undi_graph | [protected] |
| update_constraints_after_merge_nodes(gdtnode v1, gdtnode v2, gdtnode v) | undi_graph | [protected] |
| update_constraints_after_split_edge(gdtedge e, gdtedge e1, gdtedge e2) | undi_graph | [protected] |
| update_constraints_after_split_node(gdtnode v, gdtnode v1, gdtnode v2) | undi_graph | [protected] |
| update_constraints_on_path_replacing_edge(gdtedge e, undi_graph &ug, gdt::gdtlist< gdtedge > path) | undi_graph | [protected] |
| update_max_constraint_id() | undi_graph | |
| update_max_edge_id() | undi_graph | |
| update_max_face_id() | plan_undi_graph | |
| update_max_node_id() | undi_graph | |
| update_node_and_bend_positions_according_to(dime_orth_plan_undi_graph &dopug) | dime_orth_plan_undi_graph | |
| visible_subgraph(gdtnode n, int k, undi_graph &vg) | undi_graph | |
| visit_from_node_through_not_marked_nodes(gdtnode v, gdt::gdtnode_array< bool > &marked_node, gdt::gdtlist< gdtedge > &visited_edges) const | undi_graph | |
| weld_edges_at_node(gdtnode v) | dime_orth_plan_undi_graph | |
| write(std::string file_name) | undi_graph | |
| ~dime_orth_plan_undi_graph() | dime_orth_plan_undi_graph | |
| ~orth_plan_undi_graph() | orth_plan_undi_graph | |
| ~plan_undi_graph() | plan_undi_graph | |
| ~undi_graph() | undi_graph |
1.5.3