title
Graph Drawing Toolkit

An object-oriented C++ library for handling and drawing graphs

dire_graph Member List

This is the complete list of members for dire_graph, including all inherited members.

adj_edges(gdtnode v) const undi_graph
adj_nodes(gdtnode v) const undi_graph
adj_pred(gdtedge e, gdtnode v) const undi_graph
adj_succ(gdtedge e, gdtnode v) const undi_graph
all_constraints() const undi_graph
all_edges() const undi_graph
all_edges_are_directed() const undi_graph
all_nodes() const undi_graph
append_section_to_fstream(std::ofstream &out)undi_graph
assign_id(gdtnode v, int new_id=AUTO_ID)undi_graph
assign_id(gdtedge e, int new_id=AUTO_ID)undi_graph
assign_id(constraint c, int new_id=AUTO_ID)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
boyer(gdtnode root)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_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()dire_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
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)undi_graph
contract()undi_graph
copy_constraints_from_subgraph_of_undi_graph(gdt::gdtlist< gdtedge > &sub, undi_graph &ug)undi_graph [protected]
corresponding_constraint(constraint c, const undi_graph &ug) const undi_graph
corresponding_edge(gdtedge e, const undi_graph &ug) const undi_graph
corresponding_node(gdtnode v, const undi_graph &ug) const 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 undi_graph
cyclic_adj_succ(gdtedge e, gdtnode v) const 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
degree(gdtnode v) const 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)undi_graph
del_node(gdtnode v)undi_graph
destroy_bicomp(gdt::gdtlist< bic_obj * > &bic_obj_created)undi_graph
Dijkstra(gdtnode s, gdt::gdtedge_array< int > &length, gdt::gdtnode_array< int > &distance, gdt::gdtnode_array< gdtedge > &pred_edge)dire_graph
dire_graph()dire_graph
dire_graph(const undi_graph &)dire_graph
disable_keep_ordering_of_directed_edges()undi_graph
edge_is_directed(gdtedge e) const undi_graph
edges_with_extremal_nodes(gdtnode v1, gdtnode v2) const undi_graph
enable_keep_ordering_of_directed_edges()undi_graph
expand(gdtnode v, gdtedge e_init, gdtedge e_end)undi_graph
extended_kplanarity(gdtnode n)undi_graph
extended_kplanarity(gdt::gdtnode_map< int > &kplan)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_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_edges_marked_as(marker_type m) const 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_longest_path(gdtnode s, gdt::gdtedge_array< int > &length, gdt::gdtnode_array< int > &distance, gdt::gdtnode_array< gdtedge > &pred_edge)dire_graph
find_node(int id) const 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_path_with_minimum_switches(gdtnode s, gdt::gdtnode_array< int > &switches, gdt::gdtnode_array< gdtedge > &pred_edge, visit_direction_type dir)dire_graph
find_path_with_minimum_switches(gdtnode s, gdtnode t, gdt::gdtnode_array< int > &switches, gdt::gdtnode_array< gdtedge > &pred_edge)dire_graph
find_shortest_path(gdtnode s, gdt::gdtedge_array< int > &length, gdt::gdtnode_array< int > &distance, gdt::gdtnode_array< gdtedge > &pred_edge)dire_graph
find_sink()dire_graph
find_source()dire_graph
first_adj_edge(gdtnode v) const undi_graph
first_constraint() const undi_graph
first_edge() const undi_graph
first_in_edge(gdtnode v)undi_graph
first_node() const undi_graph
first_out_edge(gdtnode v)undi_graph
forget()undi_graph
generate_constraint_id()undi_graph
generate_edge_id()undi_graph
generate_node_id()undi_graph
generate_plan_biconnected(int n, double prob_iv, int k=INFINITE, bool multiple=true)undi_graph
get_max_constraint_id() const undi_graph
get_max_edge_id() const undi_graph
get_max_node_id() const undi_graph
id(gdtnode v) const undi_graph
id(gdtedge e) const 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
internal_consistency_check() const undi_graph
is_acyclic()dire_graph
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_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 undi_graph
last_constraint() const undi_graph
last_edge() const undi_graph
last_in_edge(gdtnode v)undi_graph
last_node() const undi_graph
last_out_edge(gdtnode v)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_acyclic()dire_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_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()undi_graph
make_sink(gdtnode v)undi_graph
make_source(gdtnode v)undi_graph
undi_graph::make_undirected(gdtedge e)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
merge_biconnected(gdt::gdtlist< undi_graph * > &bic)undi_graph
min_degree() const 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 v1, gdtnode v2, int new_id=AUTO_ID)dire_graph
new_edge(gdtnode v1, gdtedge e1, gdtnode v2, int new_id=AUTO_ID, int dir=gdt::after)dire_graph
new_edge(gdtnode v1, gdtnode v2, gdtedge e2, int new_id=AUTO_ID, int dir=gdt::after)dire_graph
new_edge(gdtnode v, gdtedge ev, gdtnode w, gdtedge ew, int new_id=AUTO_ID, int dir=gdt::after)dire_graph
new_node(int new_id=AUTO_ID)undi_graph
new_node(gdt::gdtlist< gdtnode > L, int new_id=AUTO_ID)undi_graph
node_belongs_to_edge(gdtnode v, gdtedge e) const undi_graph
node_between_adj_edges(gdtedge e1, gdtedge e2) const undi_graph
nodes_and_edges() const undi_graph
number_of_constraints() const undi_graph
number_of_edges() const undi_graph
number_of_extremals() const undi_graph
number_of_nodes() const undi_graph
operator=(const undi_graph &)dire_graph
opposite(gdtnode v, gdtedge e) const undi_graph [inline]
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]
planarize(planarize_options po=DO_NOT_PRESERVE_EMBEDDING)undi_graph
pos_of_edge_in_adj_edges_of_node(gdtedge e, gdtnode v) const undi_graph
pred_constraint(constraint c) const undi_graph
pred_edge(gdtedge e) const undi_graph
pred_node(gdtnode v) const undi_graph
print(print_mode mode=BY_NODES, std::ostream &os=std::cout) const undi_graph
print(gdtnode v, std::ostream &os=std::cout) const undi_graph
print(gdtedge e, std::ostream &os=std::cout) const undi_graph
print(constraint c, std::ostream &os=std::cout) const 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
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
reverse(gdtedge e)undi_graph
reverse_of_edge(gdtedge e)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
set_source(gdtedge, gdtnode)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, visit_direction_type dt=OUTGOING)dire_graph
undi_graph::simple_DFS(gdtnode v, gdt::gdtnode_array< bool > &reached, gdt::gdtnode_array< gdtedge > &father, gdt::gdtlist< gdtnode > &order) const 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
st_number(gdtedge e_st, gdtnode s, gdt::gdtnode_array< int > &st_num)undi_graph
start(gdtedge e) const undi_graph [inline]
steal_from(undi_graph &ug)dire_graph
stop(gdtedge e) const undi_graph
succ_constraint(constraint c) const undi_graph
succ_edge(gdtedge e) const undi_graph
succ_node(gdtnode v) const undi_graph
target(gdtedge e) const undi_graph [inline]
topological_sort(gdtnode v, gdt::gdtnode_array< bool > &reached, gdt::gdtlist< gdtnode > &order)dire_graph
type_of_constraint(constraint c) const 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_node_id()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)undi_graph
write(std::string file_name)undi_graph
~undi_graph()undi_graph


Generated on Thu Jan 10 14:48:46 2008 for GDToolkit GAPI by  doxygen 1.5.3