Graph Drawing Toolkit
An object-oriented C++ library for handling and
drawing
graphs
Main Page
Namespaces
Classes
Files
S
earch for
Alphabetical List
Class List
Class Hierarchy
Class Members
All
Functions
Variables
Typedefs
Related Functions
_
a
b
c
d
e
f
g
i
l
m
n
o
p
r
s
t
u
v
w
x
y
- _ -
_axis :
_grid_line_struct
_coord :
_grid_line_struct
_edges :
simple_graph
_node_list :
_grid_line_struct
_nodes :
simple_graph
_position_into_list :
_grid_line_struct
- a -
active_bicomp :
bic_obj_node
active_passages :
bic_obj_node
active_walk_up :
bic_obj_node
actual_previous_connector :
bic_obj_node
all_computations :
BB_options
ascisse :
layered_undi_graph
- b -
bend_cost :
DD_struct
bend_type :
_solution
bends_of_map_edge :
DD_struct
black :
bic_obj
- c -
can_be_flipped :
bic_obj_node
child_count :
gdt::PQ_node_struct< T >
children :
bm_node_info
children_ordered :
bm_node_info
counter :
bic_obj
,
dfs_edge_info
,
bm_edge_info
,
struct_border_step
,
dfs_node_info
cross_cost :
DD_struct
current_path :
path_info
- d -
DFI :
dfs_node_info
,
bic_obj_node
- e -
eagle_heading :
_solution
east_edge :
pos_incid_edges
east_node :
map_node_set
edge_of_map_edge :
DD_struct
edge_path :
DD_struct
- f -
face_of_map_edge :
DD_struct
first_back_edge_dfi :
bm_node_info
first_child :
bic_obj_node
fub :
BB_options
full_children :
gdt::PQ_node_struct< T >
- g -
graph_edge :
bic_obj
graph_node :
bic_obj
- i -
id :
struct_constraint
,
gdt::PQ_node_struct< T >
in_back_edges :
bm_node_info
index :
dfs_edge_info
inf :
gdt::Record< F >
init_ref_edge :
BB_options
initial_heading :
DD_struct
inserted :
bm_edge_info
is_dummy :
layered_undi_graph
is_node :
bic_obj
- l -
label :
gdt::PQ_node_struct< T >
left_endmost :
gdt::PQ_node_struct< T >
length_unit_cost :
DD_struct
levels :
layered_undi_graph
link_left_side :
gdt::PQ_node_struct< T >
link_right_side :
gdt::PQ_node_struct< T >
list_of_path_of_dummy :
layered_undi_graph
lowpoint :
dfs_node_info
,
bm_node_info
- m -
map :
DD_struct
map_edge_cost :
DD_struct
map_edge_path :
DD_struct
map_level_PQ_tree :
layered_undi_graph
map_nodes_of_edge :
DD_struct
map_nodes_of_node :
DD_struct
mark :
gdt::PQ_node_struct< T >
marked :
bic_obj
mnt1 :
DD_struct
mnt2 :
DD_struct
msp12 :
path_info
msp21 :
path_info
- n -
N :
BB_tree_parameters
ncs :
BB_options
niu :
BB_options
node_of_map_edge :
DD_struct
north_edge :
pos_incid_edges
north_node :
map_node_set
not_active_bicomp :
bic_obj_node
number_of_cut_nodes :
BB_tree_parameters
number_of_cuts :
BB_tree_parameters
number_of_steps :
_solution
number_of_total_nodes :
BB_tree_parameters
number_of_visited_nodes :
BB_tree_parameters
- o -
ordered_first_black :
bm_node_info
- p -
parent :
gdt::PQ_node_struct< T >
,
dfs_node_info
,
bm_node_info
partial_children :
gdt::PQ_node_struct< T >
permutation :
P_node_info
pertinent_child_count :
gdt::PQ_node_struct< T >
pertinent_leaf_count :
gdt::PQ_node_struct< T >
position_in_parent_list :
bm_node_info
pred :
gdt::Record< F >
- r -
right_endmost :
gdt::PQ_node_struct< T >
rotation :
R_node_info
rpdl :
BB_options
rppl :
BB_options
- s -
score :
_solution
south_edge :
pos_incid_edges
south_node :
map_node_set
sp :
path_info
sub :
BB_options
succ :
gdt::Record< F >
sw12 :
path_info
sw21 :
path_info
- t -
text_interface :
BB_options
twin_link :
bic_obj
,
bic_obj_node
type :
gdt::PQ_node_struct< T >
,
dfs_edge_info
,
bm_edge_info
- u -
ubf :
BB_options
- v -
value :
gdt::PQ_node_struct< T >
vt1 :
DD_struct
vt2 :
DD_struct
- w -
west_edge :
pos_incid_edges
west_node :
map_node_set
white :
bic_obj
- x -
x :
vertical_segment
x_max :
horizontal_segment
x_min :
horizontal_segment
- y -
y :
horizontal_segment
y_max :
vertical_segment
y_min :
vertical_segment
Generated on Thu Jan 10 14:48:38 2008 for GDToolkit GAPI by
1.5.3