Index

()

window : 17.2

_d_array<I,E,impl> : 9.6

_dictionary<K,I,impl> : 9.2

_p_queue<P,I,impl> : 10.2

_sortseq<K,I,impl> : 9.4

abs(bigfloat x) : 7.3

abs(integer a) : 7.1

abs(rational q) : 7.2

abs(real x) : 7.4

access(K k)

dictionary<K,I> : 9.1

acknowledge(string s)

GraphWin : 17.6

window : 17.2

activate(geo_scene sc)

GeoWin : 17.7

add_dependence(geo_scene sc1, geo_scene sc2)

GeoWin : 17.7

add_edge_done_rule(gml_edge_rule f)

gml_graph : 11.25

add_edge_menu(string label, gw_action func)

GraphWin : 17.6

add_edge_rule(gml_edge_rule f, gml_value_type t, char* key=0)

gml_graph : 11.25

add_graph_done_rule(gml_graph_rule f)

gml_graph : 11.25

add_graph_rule(gml_graph_rule f, gml_value_type t, char* key=0)

gml_graph : 11.25

add_help_text(string name)

GeoWin : 17.7

GraphWin : 17.6

add_member_call(void (GraphWin::*func)(), string label, int menu_id, int bm_w, int bm_h, unsigned char* bm_bits)

GraphWin : 17.6

add_member_call(void (GraphWin::*func)(), string label, int menu_id=0, char* pmap=0)

GraphWin : 17.6

add_menu(long menu_id)

GraphWin : 17.6

add_menu(string label, int menu_id=0, char* pmap=0)

GraphWin : 17.6

add_new_edge_rule(gml_edge_rule f)

gml_graph : 11.25

add_new_graph_rule(gml_graph_rule f)

gml_graph : 11.25

add_new_node_rule(gml_node_rule f)

gml_graph : 11.25

add_node_done_rule(gml_node_rule f)

gml_graph : 11.25

add_node_menu(string label, gw_action func)

GraphWin : 17.6

add_node_rule(gml_node_rule f, gml_value_type t, char* key=0)

gml_graph : 11.25

add_scene_buttons(list<geo_scene> Ls, int w, int h, unsigned char** bm)

GeoWin : 17.7

add_scene_buttons(list<geo_scene> Ls, list<string> Ln)

GeoWin : 17.7

add_separator(int menu_id)

GraphWin : 17.6

add_simple_call(void (*func)(GraphWin& ), string label, int menu_id, int bm_w, int bm_h, unsigned char* bm_bits)

GraphWin : 17.6

add_simple_call(void (*func)(GraphWin& ), string label, int menu_id=0, char* pmap=0)

GraphWin : 17.6

add_to_day(int d)

date : 6.19

add_to_month(int m)

date : 6.19

add_to_year(int y)

date : 6.19

addcost(d_vertex v, double x)

tree_collection<I> : 8.15

address(const_reference r)

leda_allocator<T> : 6.12

address(reference r)

leda_allocator<T> : 6.12

adj_edges(face)

graph : 11.1

adj_edges(node v)

graph : 11.1

adj_face(edge e)

graph : 11.1

adj_faces(node v)

graph : 11.1

adj_nodes(face f)

graph : 11.1

adj_nodes(node v)

graph : 11.1

adj_pred(edge e)

graph : 11.1

adj_pred(edge e, node v)

graph : 11.1

adj_succ(edge e)

graph : 11.1

adj_succ(edge e, node v)

graph : 11.1

AdjIt : 13.7

adjust_coords_to_box(node_array<double>& xpos, node_array<double>& ypos, double x0, double y0, double x1, double y1)

GraphWin : 17.6

adjust_coords_to_box(node_array<double>& xpos, node_array<double>& ypos, edge_array<list<double> >& xbends, edge_array<list<double> >& ybends, double x0, double y0, double x1, double y1)

GraphWin : 17.6

adjust_coords_to_win(node_array<double>& xpos, node_array<double>& ypos)

GraphWin : 17.6

adjust_coords_to_win(node_array<double>& xpos, node_array<double>& ypos, edge_array<list<double> >& xbends, edge_array<list<double> >& ybends)

GraphWin : 17.6

affine_rank(array<d3_point> A) : 16.1

affine_rank(array<d3_point> L) : 16.1

affine_rank(array<d3_rat_point> A) : 16.8

affine_rank(array<d3_rat_point> L) : 16.8

affinely_independent(array<d3_point> A) : 16.1

affinely_independent(array<d3_rat_point> A) : 16.8

affinely_independent(array<point> A) : 14.1

affinely_independent(array<rat_point> A) : 14.8

affinely_independent(list<d3_point> L) : 16.1

affinely_independent(list<d3_rat_point> L) : 16.8

all_edges()

graph : 11.1

ALL_EMPTY_CIRCLES(list<point> L, list<circle>& CL) : 14.13

ALL_ENCLOSING_CIRCLES(list<point> L, list<circle>& CL) : 14.13

all_faces()

graph : 11.1

all_items()

d2_dictionary<K1,K2,I> : 15.1

all_nodes()

graph : 11.1

allocate(size_type n, const_pointer = 0)

leda_allocator<T> : 6.12

alt_key_down()

window : 17.2

angle()

line : 14.4

segment : 14.2

angle(line g)

line : 14.4

angle(point q, point r)

point : 14.1

angle(ray s)

ray : 14.3

angle(segment t)

segment : 14.2

angle(vector w)

vector : 7.6

append(const char* key)

gml_graph : 11.25

append(E x)

b_queue<E> : 8.6

list<E> : 8.7

queue<E> : 8.4

slist<E> : 8.8

append(node v)

node_list : 11.17

apply(void (*f)(E& x))

list<E> : 8.7

area()

GEN_POLYGON : 14.7

POLYGON : 14.6

area(point a, point b, point c) : 14.1

area(rat_point a, rat_point b, rat_point c) : 14.8

array2<E> : 8.2

array<E> : 8.1

ask_edge()

GraphWin : 17.6

ask_node()

GraphWin : 17.6

assign(edge e, etype x)

GRAPH<vtype,e...> : 11.2

PLANAR_MAP<vtype,e...> : 11.6

assign(face f, ftype x)

PLANAR_MAP<vtype,e...> : 11.6

assign(list_item it, E x)

list<E> : 8.7

assign(node v, vtype x)

GRAPH<vtype,e...> : 11.2

PLANAR_MAP<vtype,e...> : 11.6

b_node_pq<N> : 11.20

b_priority_queue<K> : 10.3

b_queue<E> : 8.6

b_stack<E> : 8.5

back()

list<E> : 8.7

basic_graph_alg : 12.1

begin()

STLNodeIt<DataAcc...> : 13.12

BF_GEN(GRAPH<int,int>& G, int n, int m, bool non_negative = true) : 12.2

BFS(graph G, node s, node_array<int>& dist) : 12.1

BFS(graph G, node s, node_array<int>& dist, node_array<edge>& pred) : 12.1

BICONNECTED_COMPONENTS(graph G, edge_array<int>& compnum) : 12.1

bigfloat : 7.3

binary_entropy(double x) : 7.11.3

binary_locate(E x)

array<E> : 8.1

binary_locate(int (*cmp)(E, E ), E x)

array<E> : 8.1

binary_search(E x)

array<E> : 8.1

binary_search(int (*cmp)(E, E ), E x)

array<E> : 8.1

bool_item(string s, bool& x, const char* hlp=0)

window : 17.2

bool_item(string s, bool& x, void (*F)(int), const char* hlp=0)

window : 17.2

Bounding_Box(list<point> L, point& pl, point& pb, point& pr, point& pt) : 14.13

bounding_box(POINT& xmin, POINT& ymin, POINT& xmax, POINT& ymax)

POLYGON : 14.6

bucket_sort(int (*f)(E ))

list<E> : 8.7

bucket_sort(int i, int j, int (*f)(E ))

list<E> : 8.7

bucket_sort_edges(edge_array<int> A)

graph : 11.1

bucket_sort_edges(int (*ord)(edge ))

graph : 11.1

bucket_sort_edges(int l, int h, int (*ord)(edge ))

graph : 11.1

bucket_sort_nodes(int (*ord)(node ))

graph : 11.1

bucket_sort_nodes(int l, int h, int (*ord)(node ))

graph : 11.1

bucket_sort_nodes(node_array<int> A)

graph : 11.1

button(char* pr1, char* pr2, string s, int n, const char* hlp=0)

window : 17.2

button(char* pr1, char* pr2, string s, int n, void (*F)(int), const char* hlp=0)

window : 17.2

button(char* pr1, char* pr2, string s, int n, window& M, const char* hlp=0)

window : 17.2

button(char* pr1, char* pr2, string s, void (*F)(int), const char* hlp=0)

window : 17.2

button(char* pr1, char* pr2, string s, window& M, const char* hlp=0)

window : 17.2

button(int w, int h, unsigned char* bm, string s, const char* hlp=0)

window : 17.2

button(int w, int h, unsigned char* bm, string s, int n, const char* hlp=0)

window : 17.2

button(int w, int h, unsigned char* bm, string s, int n, void (*F)(int), const char* hlp=0)

window : 17.2

button(int w, int h, unsigned char* bm, string s, int n, window& M, const char* hlp=0)

window : 17.2

button(int w, int h, unsigned char* bm, string s, void (*F)(int), const char* hlp=0)

window : 17.2

button(int w, int h, unsigned char* bm, string s, window& M, const char* hlp=0)

window : 17.2

button(string s)

menu : 17.4

button(string s, const char* hlp=0)

window : 17.2

button(string s, int n)

menu : 17.4

button(string s, int n, const char* hlp=0)

window : 17.2

button(string s, int n, void (*F)(int))

menu : 17.4

button(string s, int n, void (*F)(int), const char* hlp=0)

window : 17.2

button(string s, int n, window& M, const char* hlp=0)

window : 17.2

button(string s, int n, window& W)

menu : 17.4

button(string s, void (*F)(int))

menu : 17.4

button(string s, void (*F)(int), const char* hlp=0)

window : 17.2

button(string s, window& M, const char* hlp=0)

window : 17.2

button(string s, window& W)

menu : 17.4

button_press_time()

window : 17.2

button_release_time()

window : 17.2

buttons_per_line(int n)

window : 17.2

C_style()

array<E> : 8.1

canonical_rep()

GEN_POLYGON : 14.7

catch_system_errors(bool b=true) : 6.13

ceil(bigfloat x) : 7.3

ceil(rational q) : 7.2

center()

circle : 14.5

d3_rat_sphere : 16.13

d3_sphere : 16.6

rat_circle : 14.12

center(d3_point a, d3_point b) : 16.1

center(point a, point b) : 14.1

center_pixrect(double x, double y, char* pr)

window : 17.2

CGAL : 13.1.4 | 13.5

change_inf(dic2_item it, I i)

d2_dictionary<K1,K2,I> : 15.1

change_inf(dic_item it, I i)

dictionary<K,I> : 9.1

change_inf(is_item it, I i)

interval_set<I> : 15.3

change_inf(p_dic_item it, I i)

p_dictionary<K,I> : 9.10

change_inf(partition_item it, E x)

Partition<E> : 8.13

change_inf(pp_dic_item it, I i)

pp_dictionary<K,I,CMP> : 9.11

change_inf(pq_item it, I i)

p_queue<P,I> : 10.1

change_inf(seg_item it, I i)

segment_set<I> : 15.4

change_inf(seq_item it, I i)

sortseq<K,I> : 9.3

CHECK_HULL(GRAPH<d3_point,int> H) : 16.15

CHECK_HULL(GRAPH<d3_rat_point,int> H) : 16.15

CHECK_KURATOWSKI(graph G, list<edge> el) : 12.11

CHECK_MAX_CARD_MATCHING(graph G, list<edge> M, node_array<int> OSC) : 12.8

CHECK_MCB(graph G, list<edge> M, node_array<bool> NC) : 12.6

check_representation()

GEN_POLYGON : 14.7

check_simplicity()

POLYGON : 14.6

choice_item(string s, int& x, int n, int w, int h, unsigned char** bm, const char* hlp=0)

window : 17.2

choice_item(string s, int& x, int n, int w, int h, unsigned char** bm, void (*F)(int), const char* hlp=0)

window : 17.2

choice_item(string s, int& x, list<string> L, void (*F)(int)=0, const char* hlp=0)

window : 17.2

choice_item(string s, int& x, string s1, ..., string sk)

window : 17.2

choice_mult_item(string s, int& x, int n, int w, int h, unsigned char** bm, const char* hlp=0)

window : 17.2

choice_mult_item(string s, int& x, int n, int w, int h, unsigned char** bm, void (*F)(int), const char* hlp=0)

window : 17.2

choice_mult_item(string s, int& x, list<string> L, const char* hlp=0)

window : 17.2

choice_mult_item(string s, int& x, list<string> L, void (*F)(int), const char* hlp=0)

window : 17.2

choose()

d_int_set : 8.11

edge_set : 11.16

node_set : 11.15

set<E> : 8.9

choose_edge()

graph : 11.1

choose_face()

graph : 11.1

choose_node()

graph : 11.1

circle : 14.5

circulators : 13.5

circumscribing_sphere()

d3_rat_simplex : 16.14

d3_simplex : 16.7

clear()

b_queue<E> : 8.6

b_stack<E> : 8.5

d2_dictionary<K1,K2,I> : 15.1

d_array<I,E> : 9.5

d_int_set : 8.11

dictionary<K,I> : 9.1

edge_set : 11.16

graph : 11.1

h_array<I,E> : 9.7

int_set : 8.10

interval_set<I> : 15.3

list<E> : 8.7

map2<I1,I2,E> : 9.9

map<I,E> : 9.8

node_list : 11.17

node_pq<P> : 11.19

node_set : 11.15

p_queue<P,I> : 10.1

POINT_SET : 15.2

pp_dictionary<K,I,CMP> : 9.11

queue<E> : 8.4

segment_set<I> : 15.4

set<E> : 8.9

sortseq<K,I> : 9.3

stack<E> : 8.3

window : 17.2

clear(color c)

window : 17.2

clear(double x0, double y0, double x1, double y1)

window : 17.2

clear(double xorig, double yorig)

window : 17.2

clear(E x)

map<I,E> : 9.8

clear_actions()

GeoWin : 17.7

GraphWin : 17.6

clear_graph()

GraphWin : 17.6

clip(point p, point q, segment& s)

line : 14.4

clip(rat_point p, rat_point q, rat_segment& s)

rat_line : 14.11

close()

GeoWin : 17.7

GraphWin : 17.6

window : 17.2

CLOSEST_PAIR(list<point>& L, point& r1, point& r2) : 14.13

cmd_istream : 6.6

cmd_ostream : 6.7

cmdline_graph(graph& G, int argc, char** argv) : 11.21

cmp_dist(point q, point r)

point : 14.1

cmp_dist(rat_point q, rat_point r)

rat_point : 14.8

cmp_distances(d3_point p1, d3_point p2, d3_point p3, d3_point p4) : 16.1

cmp_distances(d3_rat_point p1, d3_rat_point p2, d3_rat_point p3, d3_rat_point p4) : 16.8

cmp_distances(point p1, point p2, point p3, point p4) : 14.1

cmp_distances(rat_point p1, rat_point p2, rat_point p3, rat_point p4) : 14.8

cmp_segments_at_xcoord(rat_segment s1, rat_segment s2, rat_point p) : 14.9

cmp_segments_at_xcoord(segment s1, segment s2, point p) : 14.2

cmp_signed_dist(point a, point b, point c, point d) : 14.1

cmp_signed_dist(rat_point a, rat_point b, rat_point c, rat_point d) : 14.8

cmp_slope(rat_segment s1)

rat_segment : 14.9

cmp_slopes(line l1, line l2) : 14.4

cmp_slopes(rat_line l1, rat_line l2) : 14.11

cmp_slopes(rat_ray r1, rat_ray r2) : 14.10

cmp_slopes(rat_segment s1, rat_segment s2) : 14.9

cmp_slopes(ray r1, ray r2) : 14.3

cmp_slopes(segment s1, segment s2) : 14.2

cocircular(point a, point b, point c, point d) : 14.1

cocircular(rat_point a, rat_point b, rat_point c, rat_point d) : 14.8

col(int i)

integer_matrix : 7.9

matrix : 7.7

collinear(d3_point a, d3_point b, d3_point c) : 16.1

collinear(d3_rat_point a, d3_rat_point b, d3_rat_point c) : 16.8

collinear(point a, point b, point c) : 14.1

collinear(rat_point a, rat_point b, rat_point c) : 14.8

color : 17.1

color_item(string s, color& x, const char* hlp=0)

window : 17.2

color_item(string s, color& x, void (*F)(int), const char* hlp=0)

window : 17.2

compare(...) : see User defined parameter types

compare_by_angle(rat_vector v1, rat_vector v2) : 7.10

compare_by_angle(vector v1, vector v2) : 7.6

complement()

GEN_POLYGON : 14.7

POLYGON : 14.6

complete_bigraph(graph& G, int a, int b, list<node>& A, list<node>& B) : 11.21

complete_graph(graph& G, int n) : 11.21

complete_ugraph(graph& G, int n) : 11.21

compnumb()

GIT_SCC<Out,In,...> : 13.20

COMPONENTS(graph G, node_array<int>& compnum) : 12.1

CompPred<Iter,DA...> : 13.10

compute_faces()

graph : 11.1

compute_voronoi(GRAPH<CIRCLE,POINT>& V)

POINT_SET : 15.2

compute_with_precision(long k)

real : 7.4

conc(list<E>& L1, int dir = LEDA::after)

list<E> : 8.7

conc(slist<E>& L1)

slist<E> : 8.8

conc(sortseq<K,I>& S1, int dir = LEDA::after)

sortseq<K,I> : 9.3

confirm(string s)

window : 17.2

constant_da<T> : 13.14

construct(pointer p, const_reference r)

leda_allocator<T> : 6.12

contained_in_affine_hull(array<d3_point> A, d3_point x) : 16.1

contained_in_affine_hull(array<d3_rat_point> A, d3_rat_point x) : 16.8

contained_in_affine_hull(array<point> A, point p) : 14.1

contained_in_affine_hull(array<rat_point> A, rat_point p) : 14.8

contained_in_affine_hull(list<d3_point> L, d3_point x) : 16.1

contained_in_affine_hull(list<d3_rat_point> L, d3_rat_point x) : 16.8

contained_in_linear_hull(array<rat_vector> A, rat_vector x) : 7.10

contained_in_simplex(array<d3_point> A, d3_point x) : 16.1

contained_in_simplex(array<d3_rat_point> A, d3_rat_point x) : 16.8

contained_in_simplex(array<point> A, point p) : 14.1

contained_in_simplex(array<rat_point> A, rat_point p) : 14.8

contained_in_simplex(d3_point a, d3_point b, d3_point c, d3_point d, d3_point x) : 16.1

contained_in_simplex(d3_rat_point a, d3_rat_point b, d3_rat_point c, d3_rat_point d, d3_rat_point x) : 16.8

contains(d3_point p)

d3_line : 16.4

d3_ray : 16.2

d3_segment : 16.3

d3_sphere : 16.6

contains(d3_point q)

d3_plane : 16.5

contains(d3_rat_point p)

d3_rat_line : 16.10

d3_rat_ray : 16.9

d3_rat_segment : 16.11

d3_rat_sphere : 16.13

contains(d3_rat_point q)

d3_rat_plane : 16.12

contains(d3_rat_segment s)

d3_rat_ray : 16.9

contains(d3_segment s)

d3_ray : 16.2

contains(point p)

circle : 14.5

GEN_POLYGON : 14.7

line : 14.4

POLYGON : 14.6

segment : 14.2

window : 17.2

contains(point)

ray : 14.3

contains(rat_point p)

rat_circle : 14.12

rat_line : 14.11

rat_ray : 14.10

rat_segment : 14.9

contains(rat_segment s)

rat_ray : 14.10

contains(segment)

ray : 14.3

contents(int i)

integer : 7.1

contents(list_item it)

list<E> : 8.7

contents(slist_item it)

slist<E> : 8.8

CONVEX_COMPONENTS(gen_polygon GP, GRAPH<point,segment>& G, list<edge>& inner_edges, list<edge>& boundary_edges, list<edge>& hole_edges) : 14.13

CONVEX_COMPONENTS(polygon P, GRAPH<point,segment>& G, list<edge>& inner_edges, list<edge>& boundary) : 14.13

CONVEX_HULL(list<d3_point> L, GRAPH<d3_point,int>& H) : 16.15

CONVEX_HULL(list<d3_rat_point> L, GRAPH<d3_rat_point,int>& H) : 16.15

CONVEX_HULL(list<point> L) : 14.13

CONVEX_HULL_IC(list<point> L) : 14.13

CONVEX_HULL_POLY(list<point> L) : 14.13

CONVEX_HULL_RIC(list<point> L) : 14.13

CONVEX_HULL_S(list<point> L) : 14.13

coord(int i)

rat_vector : 7.10

vector : 7.6

coord_type

circle : 14.5

d3_rat_simplex : 16.14

d3_simplex : 16.7

line : 14.4

point : 14.1

POLYGON : 14.6

rat_circle : 14.12

rat_line : 14.11

rat_point : 14.8

rat_ray : 14.10

rat_segment : 14.9

ray : 14.3

segment : 14.2

coplanar(d3_point a, d3_point b, d3_point c, d3_point d) : 16.1

coplanar(d3_rat_point a, d3_rat_point b, d3_rat_point c, d3_rat_point d) : 16.8

copy(int x, array<E> B, int y)

array<E> : 8.1

copy(int x, int y)

array<E> : 8.1

copy_rect(double x0, double y0, double x1, double y1, double x, double y)

window : 17.2

CopyGraph(GRAPH<node,edge>& H, graph G) : 11.22

CopyGraph(GRAPH<node,edge>& H, graph G, list<edge> E) : 11.22

CopyGraph(GRAPH<node,edge>& H, graph G, list<node> V, list<edge> E) : 11.22

CopyGraph(graph& H, graph G) : 11.22

cost(vertex v)

dynamic_trees : 8.14

create_bitmap(int w, int h, unsigned char* bm_data)

window : 17.2

create_directory(string fname) : 6.14

create_pixrect(const char** xpm_str)

window : 17.2

create_pixrect(int w, int h, unsigned char* bm_data, int fg=window::fgcol, int bg=window::bgcol)

window : 17.2

create_pixrect(string xpm_file)

window : 17.2

CRUST(list<point> L0, GRAPH<point,int>& G) : 14.13

ctrl_key_down()

window : 17.2

curr_adj()

AdjIt : 13.7

GIT_DIJKSTRA<OutAdjI...> : 13.21

InAdjIt : 13.6

OutAdjIt : 13.5

current()

GIT_BFS<OutAdjI...> : 13.17

GIT_DFS<OutAdjI...> : 13.18

GIT_DIJKSTRA<OutAdjI...> : 13.21

GIT_TOPOSORT<OutAdjI...> : 13.19

current_node()

dynamic_markov_chain : 11.24

GIT_SCC<Out,In,...> : 13.20

markov_chain : 11.23

current_outdeg()

dynamic_markov_chain : 11.24

markov_chain : 11.23

cut(d_vertex v)

tree_collection<I> : 8.15

cut(vertex v)

dynamic_trees : 8.14

CUT_VALUE(graph G, edge_array<int> weight, list<node> C) : 12.5

cycle_found()

GIT_TOPOSORT<OutAdjI...> : 13.19

cyclic_adj_pred(edge e)

graph : 11.1

cyclic_adj_pred(edge e, node v)

graph : 11.1

cyclic_adj_succ(edge e)

graph : 11.1

cyclic_adj_succ(edge e, node v)

graph : 11.1

cyclic_in_pred(edge e)

graph : 11.1

cyclic_in_succ(edge e)

graph : 11.1

cyclic_pred(list_item it)

list<E> : 8.7

cyclic_pred(node v)

node_list : 11.17

cyclic_succ(list_item it)

list<E> : 8.7

cyclic_succ(node v)

node_list : 11.17

cyclic_succ(slist_item it)

slist<E> : 8.8

d2(integer a, integer b, integer D)

rat_vector : 7.10

d2_dictionary<K1,K2,I> : 15.1

d3(integer a, integer b, integer c, integer D)

rat_vector : 7.10

d3_grid_graph(graph& G, int n) : 11.21

d3_grid_graph(graph& G, node_array<double>& xcoord, node_array<double>& ycoord, node_array<double>& zcoord, int n) : 11.21

d3_hull : 16.15

d3_line : 16.4

d3_plane : 16.5

d3_point : 16.1

d3_rat_line : 16.10

d3_rat_plane : 16.12

d3_rat_point : 16.8

d3_rat_ray : 16.9

d3_rat_segment : 16.11

d3_rat_simplex : 16.14

d3_rat_sphere : 16.13

d3_ray : 16.2

d3_segment : 16.3

d3_simplex : 16.7

d3_sphere : 16.6

d_array<I,E> : 9.5

d_face_cycle_pred(edge e)

POINT_SET : 15.2

d_face_cycle_succ(edge e)

POINT_SET : 15.2

d_int_set : 8.11

data accessor : 13.1.5

date : 6.19

days_until(date D2)

date : 6.19

deallocate(pointer p, size_type n)

leda_allocator<T> : 6.12

decrease_p(node v, P x)

node_pq<P> : 11.19

decrease_p(pq_item it, P x)

p_queue<P,I> : 10.1

define_area(double& x0, double& y0, double& x1, double& y1, const char* msg=")

GraphWin : 17.6

defined(I i)

d_array<I,E> : 9.5

h_array<I,E> : 9.7

map<I,E> : 9.8

defined(I1 i, I2 j)

map2<I1,I2,E> : 9.9

defined(node v, node w)

node_map2<E> : 11.14

degree(node v)

graph : 11.1

del()

AdjIt : 13.7

EdgeIt : 13.3

InAdjIt : 13.6

NodeIt : 13.2

OutAdjIt : 13.5

del(double x, double y)

interval_set<I> : 15.3

del(E x)

set<E> : 8.9

del(edge x)

edge_set : 11.16

del(geo_scenegroup GS, geo_scene sc)

GeoWin : 17.7

del(int i)

string : 6.1

del(int i, int j)

string : 6.1

del(int x)

d_int_set : 8.11

int_set : 8.10

del(K k)

dictionary<K,I> : 9.1

p_dictionary<K,I> : 9.10

pp_dictionary<K,I,CMP> : 9.11

sortseq<K,I> : 9.3

del(K1 x, K2 y)

d2_dictionary<K1,K2,I> : 15.1

del(list_item it)

list<E> : 8.7

del(node v)

node_list : 11.17

node_pq<P> : 11.19

POINT_SET : 15.2

del(node w)

b_node_pq<N> : 11.20

del(node x)

node_set : 11.15

del(POINT p)

POINT_SET : 15.2

del(segment s)

segment_set<I> : 15.4

del(string s1, int i=1)

string : 6.1

del_all(string s1)

string : 6.1

del_all_edges()

graph : 11.1

del_all_faces()

graph : 11.1

del_all_nodes()

graph : 11.1

del_bitmap(char* bm)

window : 17.2

del_dependence(geo_scene sc1, geo_scene sc2)

GeoWin : 17.7

del_edge(edge e)

graph : 11.1

GraphWin : 17.6

planar_map : 11.5

del_edges(list<edge> L)

graph : 11.1

del_item(dic2_item it)

d2_dictionary<K1,K2,I> : 15.1

del_item(dic_item it)

dictionary<K,I> : 9.1

del_item(is_item it)

interval_set<I> : 15.3

del_item(list_item it)

list<E> : 8.7

del_item(p_dic_item it)

p_dictionary<K,I> : 9.10

del_item(pp_dic_item it)

pp_dictionary<K,I,CMP> : 9.11

del_item(pq_item it)

p_queue<P,I> : 10.1

del_item(seg_item it)

segment_set<I> : 15.4

del_item(seq_item it)

sortseq<K,I> : 9.3

del_menu(long menu_id)

GraphWin : 17.6

del_message()

GraphWin : 17.6

window : 17.2

del_min()

b_node_pq<N> : 11.20

node_pq<P> : 11.19

p_queue<P,I> : 10.1

del_node(node v)

graph : 11.1

GraphWin : 17.6

del_nodes(list<node> L)

graph : 11.1

del_pin_point()

GeoWin : 17.7

del_pixrect(char* pr)

window : 17.2

del_succ_item(slist_item it)

slist<E> : 8.8

DELAUNAY_DIAGRAM(list<point> L, GRAPH<point,int>& DD) : 14.13

DELAUNAY_TRIANG(GRAPH<point,segment>& G) : 14.13

DELAUNAY_TRIANG(list<point> L, GRAPH<point,int>& DT) : 14.13

DELAUNAY_TRIANG(list<segment> L, GRAPH<point,segment>& G) : 14.13

delete_file(string fname) : 6.14

Delete_Loops(graph& G) : 11.22

delete_subsequence(seq_item a, seq_item b, sortseq<K,I>& S1)

sortseq<K,I> : 9.3

denominator()

rational : 7.2

deselect(edge e)

GraphWin : 17.6

deselect(node v)

GraphWin : 17.6

deselect_all()

GraphWin : 17.6

deselect_all_edges()

GraphWin : 17.6

deselect_all_nodes()

GraphWin : 17.6

design pattern : 13.1.1

destroy(geo_scene sc)

GeoWin : 17.7

destroy(pointer p)

leda_allocator<T> : 6.12

det()

matrix : 7.7

determinant(integer_matrix M) : 7.9

determinant(integer_matrix M, integer_matrix& L, integer_matrix& U, array<int>& q, integer_vector& c) : 7.9

DFS(graph G, node s, node_array<bool>& reached) : 12.1

DFS_NUM(graph G, node_array<int>& dfsnum, node_array<int>& compnum) : 12.1

dictionary<K,I> : 9.1

diff(d_int_set T)

d_int_set : 8.11

diff(GEN_POLYGON Q)

GEN_POLYGON : 14.7

diff(set<E> T)

set<E> : 8.9

dim()

integer_vector : 7.8

POINT_SET : 15.2

rat_vector : 7.10

vector : 7.6

dim1()

integer_matrix : 7.9

matrix : 7.7

dim2()

integer_matrix : 7.9

matrix : 7.7

direction()

line : 14.4

ray : 14.3

segment : 14.2

disable_button(int b)

window : 17.2

disable_call(int id)

GraphWin : 17.6

disable_calls()

GraphWin : 17.6

disable_item(panel_item it)

window : 17.2

disable_menus()

GeoWin : 17.7

disable_panel(bool disable_every_item=true)

window : 17.2

display()

GraphWin : 17.6

window : 17.2

display(int x = window::center, int y = window::center)

GeoWin : 17.7

display(int x, int y)

GraphWin : 17.6

window : 17.2

display(window& w, int x, int y)

window : 17.2

display_help_text(string fname)

GraphWin : 17.6

window : 17.2

dist(real x, real y) : 7.4

distance()

point : 14.1

segment : 14.2

distance(circle D)

circle : 14.5

distance(d3_point p)

d3_line : 16.4

distance(d3_point q)

d3_plane : 16.5

d3_point : 16.1

distance(line l)

circle : 14.5

distance(point p)

circle : 14.5

GEN_POLYGON : 14.7

POLYGON : 14.6

segment : 14.2

distance(point q)

line : 14.4

point : 14.1

DocTools : 4.7

Double(rational q) : 7.2

double_item(string s, double& x, const char* hlp=0)

window : 17.2

draw_arc(point p, point q, point r, color c=window::fgcol)

window : 17.2

draw_arc_arrow(point p, point q, point r, color c=window::fgcol)

window : 17.2

draw_arrow(double x1, double y1, double x2, double y2, color c =window::fgcol)

window : 17.2

draw_arrow(point p, point q, color c=window::fgcol)

window : 17.2

draw_arrow(segment s, color=window::fgcol)

window : 17.2

draw_arrow_head(point p, double dir, color c=window::fgcol)

window : 17.2

draw_bezier(list<point> C, int n, color c=window::fgcol)

window : 17.2

draw_bezier_arrow(list<point> C, int n, color c=window::fgcol)

window : 17.2

draw_box(double x0, double y0, double x1, double y1, color c=window::fgcol)

window : 17.2

draw_box(point p, point q, color c=window::fgcol)

window : 17.2

draw_box(rectangle R, color c=window::fgcol)

window : 17.2

draw_circle(circle C, color c=window::fgcol)

window : 17.2

draw_circle(double x, double y, double r, color c=window::fgcol)

window : 17.2

draw_circle(point p, double r, color c=window::fgcol)

window : 17.2

draw_closed_spline(list<point> L, int n, color c=window::fgcol)

window : 17.2

draw_ctext(double x, double y, string s, color c=window::fgcol)

window : 17.2

draw_ctext(point p, string s, color c=window::fgcol)

window : 17.2

draw_ctext(string s, color c=window::fgcol)

window : 17.2

draw_disc(circle C, color c=window::fgcol)

window : 17.2

draw_disc(double x, double y, double r, color c=window::fgcol)

window : 17.2

draw_disc(point p, double r, color c=window::fgcol)

window : 17.2

draw_edge(double x1, double y1, double x2, double y2, color c=window::fgcol)

window : 17.2

draw_edge(edge e, void (*draw_diagram_edge)(POINT, POINT ), void (*draw_triang_edge) (POINT, POINT ), void (*draw_hull_dart) (POINT, POINT ))

POINT_SET : 15.2

draw_edge(point p, point q, color c=window::fgcol)

window : 17.2

draw_edge(segment s, color c=window::fgcol)

window : 17.2

draw_edge_arrow(double x1, double y1, double x2, double y2, color c=window::fgcol)

window : 17.2

draw_edge_arrow(point p, point q, color c=window::fgcol)

window : 17.2

draw_edge_arrow(segment s, color c=window::fgcol)

window : 17.2

draw_edges(list<edge> L, void (*draw_edge)(POINT, POINT ))

POINT_SET : 15.2

draw_edges(void (*draw_diagram_edge)(POINT, POINT ), void (*draw_triang_edge) (POINT, POINT ), void (*draw_hull_dart) (POINT, POINT ))

POINT_SET : 15.2

draw_ellipse(double x, double y, double r1, double r2, color c=window::fgcol)

window : 17.2

draw_ellipse(point p, double r1, double r2, color c=window::fgcol)

window : 17.2

draw_filled_ellipse(double x, double y, double r1, double r2, color c=window::fgcol)

window : 17.2

draw_filled_ellipse(point p, double r1, double r2, color c=window::fgcol)

window : 17.2

draw_filled_node(double x0, double y0, color c=window::bgcol)

window : 17.2

draw_filled_node(point p, color c=window::bgcol)

window : 17.2

draw_filled_polygon(gen_polygon P, color c=window::fgcol)

window : 17.2

draw_filled_polygon(list<point> lp, color c=window::fgcol)

window : 17.2

draw_filled_polygon(polygon P, color c=window::fgcol)

window : 17.2

draw_filled_rectangle(point p, point q, color=window::fgcol)

window : 17.2

draw_filled_rectangle(rectangle R, color=window::fgcol)

window : 17.2

draw_filled_triangle(point a, point b, point c, color=window::fgcol)

window : 17.2

draw_filled_triangle(triangle T, color=window::fgcol)

window : 17.2

draw_hline(double y, color c=window::fgcol)

window : 17.2

draw_hull(void (*draw_poly)(list<POINT> ))

POINT_SET : 15.2

draw_int_node(double x, double y, int i, color c=window::bgcol)

window : 17.2

draw_int_node(point p, int i, color c=window::bgcol)

window : 17.2

draw_line(double x1, double y1, double x2, double y2, color c=window::fgcol)

window : 17.2

draw_line(line l, color c=window::fgcol)

window : 17.2

draw_line(point p, point q, color c=window::fgcol)

window : 17.2

draw_line(segment s, color c=window::fgcol)

window : 17.2

draw_node(double x0, double y0, color c=window::fgcol)

window : 17.2

draw_node(point p, color c=window::fgcol)

window : 17.2

draw_nodes(void (*draw_node)(POINT ))

POINT_SET : 15.2

draw_oriented_polygon(gen_polygon P, color c=window::fgcol)

window : 17.2

draw_oriented_polygon(list<point> lp, color c=window::fgcol)

window : 17.2

draw_oriented_polygon(polygon P, color c=window::fgcol)

window : 17.2

draw_pixel(double x, double y, color c=window::fgcol)

window : 17.2

draw_pixel(point p, color c=window::fgcol)

window : 17.2

draw_pixels(int n, double* xcoord, double* ycoord, color c=window::fgcol)

window : 17.2

draw_pixels(list<point> L, color c=window::fgcol)

window : 17.2

draw_point(double x, double y, color c=window::fgcol)

window : 17.2

draw_point(point p, color c=window::fgcol)

window : 17.2

draw_polygon(gen_polygon P, color c=window::fgcol)

window : 17.2

draw_polygon(list<point> lp, color c=window::fgcol)

window : 17.2

draw_polygon(polygon P, color c=window::fgcol)

window : 17.2

draw_polyline(int n, double* xc, double* yc, color c=window::fgcol)

window : 17.2

draw_polyline(list<point> lp, color c=window::fgcol)

window : 17.2

draw_polyline_arrow(list<point> lp, color c=window::fgcol)

window : 17.2

draw_ray(double x1, double y1, double x2, double y2, color c=window::fgcol)

window : 17.2

draw_ray(point p, point q, color c=window::fgcol)

window : 17.2

draw_ray(point p, point q, line l, color c = window::fgcol)

window : 17.2

draw_ray(ray r, color c=window::fgcol)

window : 17.2

draw_ray(segment s, color c=window::fgcol)

window : 17.2

draw_rectangle(double x0, double y0, double x1, double y1, color=window::fgcol)

window : 17.2

draw_rectangle(point p, point q, color=window::fgcol)

window : 17.2

draw_rectangle(point p, point q, double rndness, color col=window::fgcol)

window : 17.2

draw_rectangle(rectangle R, color=window::fgcol)

window : 17.2

draw_roundbox(double x0, double y0, double x1, double y1, double rndness, color col=window::fgcol)

window : 17.2

draw_roundbox(point p, point q, double rndness, color col=window::fgcol)

window : 17.2

draw_roundrect(double x0, double y0, double x1, double y1, double rndness, color col=window::fgcol)

window : 17.2

draw_segment(double x1, double y1, double x2, double y2, color c=window::fgcol)

window : 17.2

draw_segment(point p, point q, color c=window::fgcol)

window : 17.2

draw_segment(point p, point q, line l, color c = window::fgcol)

window : 17.2

draw_segment(segment s, color c=window::fgcol)

window : 17.2

draw_segments(list<segment> L, color c=window::fgcol)

window : 17.2

draw_spline(list<point> L, int n, color c=window::fgcol)

window : 17.2

draw_spline(polygon P, int n, color c=window::fgcol)

window : 17.2

draw_spline_arrow(list<point> L, int n, color c=window::fgcol)

window : 17.2

draw_text(double x, double y, string s, color c=window::fgcol)

window : 17.2

draw_text(point p, string s, color c=window::fgcol)

window : 17.2

draw_text_node(double x, double y, string s, color c=window::bgcol)

window : 17.2

draw_text_node(point p, string s, color c=window::bgcol)

window : 17.2

draw_triangle(point a, point b, point c, color=window::fgcol)

window : 17.2

draw_triangle(triangle T, color=window::fgcol)

window : 17.2

draw_vline(double x, color c=window::fgcol)

window : 17.2

draw_voro(GRAPH<CIRCLE,POINT>, void (*draw_node)(POINT ), void (*draw_edge)(POINT, POINT ), void (*draw_ray) (POINT, POINT ))

POINT_SET : 15.2

draw_voro_edges(void (*draw_edge)(POINT, POINT ), void (*draw_ray) (POINT, POINT ))

POINT_SET : 15.2

dual()

line : 14.4

rat_line : 14.11

dual_map(graph& D)

graph : 11.1

dx()

d3_rat_segment : 16.11

d3_segment : 16.3

rat_segment : 14.9

segment : 14.2

dxD()

rat_segment : 14.9

dy()

d3_rat_segment : 16.11

d3_segment : 16.3

rat_segment : 14.9

segment : 14.2

dyD()

rat_segment : 14.9

dynamic_markov_chain : 11.24

dynamic_random_variate : 6.10

dynamic_trees : 8.14

dz()

d3_rat_segment : 16.11

d3_segment : 16.3

edge_array<E> : 11.8

edge_data()

GRAPH<vtype,e...> : 11.2

edge_inf(vertex v)

dynamic_trees : 8.14

edge_map<E> : 11.11

edge_set : 11.16

EdgeIt : 13.3

edges()

GEN_POLYGON : 14.7

edit()

GeoWin : 17.7

GraphWin : 17.6

edit(geo_scene sc)

GeoWin : 17.7

element_type

d_array<I,E> : 9.5

map<I,E> : 9.8

eliminate_colinear_vertices()

POLYGON : 14.6

empty()

b_queue<E> : 8.6

b_stack<E> : 8.5

d2_dictionary<K1,K2,I> : 15.1

d_int_set : 8.11

dictionary<K,I> : 9.1

edge_set : 11.16

GEN_POLYGON : 14.7

graph : 11.1

interval_set<I> : 15.3

list<E> : 8.7

node_list : 11.17

node_pq<P> : 11.19

node_set : 11.15

p_dictionary<K,I> : 9.10

p_queue<P,I> : 10.1

POINT_SET : 15.2

POLYGON : 14.6

pp_dictionary<K,I,CMP> : 9.11

queue<E> : 8.4

segment_set<I> : 15.4

set<E> : 8.9

slist<E> : 8.8

sortseq<K,I> : 9.3

stack<E> : 8.3

enable_button(int b)

window : 17.2

enable_call(int id)

GraphWin : 17.6

enable_calls()

GraphWin : 17.6

enable_item(panel_item it)

window : 17.2

enable_menus()

GeoWin : 17.7

enable_panel()

window : 17.2

end()

rat_segment : 14.9

segment : 14.2

STLNodeIt<DataAcc...> : 13.12

eol()

AdjIt : 13.7

EdgeIt : 13.3

FaceCirc : 13.8

FaceIt : 13.4

InAdjIt : 13.6

NodeIt : 13.2

OutAdjIt : 13.5

equal_as_sets(rat_circle C1, rat_circle C2)

rat_circle : 14.12

equal_as_sets(rat_line l, rat_line g) : 14.11

equal_as_sets(rat_segment s, rat_segment t) : 14.9

erase(list_item it)

list<E> : 8.7

error : 6.13

error_handler(int err_no, const char* msg) : 6.13

evert(vertex v)

dynamic_trees : 8.14

F_DELAUNAY_DIAGRAM(list<point> L, GRAPH<point,int>& FDD) : 14.13

F_DELAUNAY_TRIANG(list<point> L, GRAPH<point,int>& FDT) : 14.13

F_VORONOI(list<point> L, GRAPH<circle,point>& FVD) : 14.13

face_array<E> : 11.9

face_cycle_pred(edge e)

graph : 11.1

face_cycle_succ(edge e)

graph : 11.1

face_map<E> : 11.12

face_of(edge e) : 11.1

graph : 11.1

FaceCirc : 13.8

FaceIt : 13.4

fbutton(string s, const char* hlp=0)

window : 17.2

fbutton(string s, int n, const char* hlp=0)

window : 17.2

fbutton(string s, int n, void (*F)(int), const char* hlp=0)

window : 17.2

file : 6.14

file_istream : 6.2

file_ostream : 6.3

fill_window()

GeoWin : 17.7

FilterNodeIt<Predica...> : 13.9

find(node v)

node_partition : 11.18

find(partition_item p)

partition : 8.12

Partition<E> : 8.13

find_min()

node_pq<P> : 11.19

p_queue<P,I> : 10.1

findcost(d_vertex v, double& x)

tree_collection<I> : 8.15

findroot(d_vertex v)

tree_collection<I> : 8.15

finger_locate(K k)

sortseq<K,I> : 9.3

finger_locate(seq_item it, K k)

sortseq<K,I> : 9.3

finger_locate_from_front(K k)

sortseq<K,I> : 9.3

finger_locate_from_rear(K k)

sortseq<K,I> : 9.3

finger_locate_pred(K k)

sortseq<K,I> : 9.3

finger_locate_pred(seq_item it, K k)

sortseq<K,I> : 9.3

finger_locate_pred_from_front(K k)

sortseq<K,I> : 9.3

finger_locate_pred_from_rear(K k)

sortseq<K,I> : 9.3

finger_locate_succ(K k)

sortseq<K,I> : 9.3

finger_locate_succ(seq_item it, K k)

sortseq<K,I> : 9.3

finger_locate_succ_from_front(K k)

sortseq<K,I> : 9.3

finger_locate_succ_from_rear(K k)

sortseq<K,I> : 9.3

finger_lookup(K k)

sortseq<K,I> : 9.3

finger_lookup(seq_item it, K k)

sortseq<K,I> : 9.3

finger_lookup_from_front(K k)

sortseq<K,I> : 9.3

finger_lookup_from_rear(K k)

sortseq<K,I> : 9.3

finish_algo()

GIT_BFS<OutAdjI...> : 13.17

GIT_DFS<OutAdjI...> : 13.18

GIT_DIJKSTRA<OutAdjI...> : 13.21

GIT_SCC<Out,In,...> : 13.20

GIT_TOPOSORT<OutAdjI...> : 13.19

finish_menu_bar()

GraphWin : 17.6

finished()

GIT_BFS<OutAdjI...> : 13.17

GIT_DFS<OutAdjI...> : 13.18

GIT_DIJKSTRA<OutAdjI...> : 13.21

GIT_SCC<Out,In,...> : 13.20

GIT_TOPOSORT<OutAdjI...> : 13.19

first()

four_tuple<A,B,C,D> : 6.18

list<E> : 8.7

slist<E> : 8.8

three_tuple<A,B,C> : 6.17

two_tuple<A,B> : 6.16

first_adj_edge(node v)

graph : 11.1

first_edge()

graph : 11.1

first_face()

graph : 11.1

first_face_edge(face f)

graph : 11.1

first_file_in_path(string fname, string path, char sep = ':') : 6.14

first_in_edge(node v)

graph : 11.1

first_node()

graph : 11.1

FIVE_COLOR(graph& G, node_array<int>& C) : 12.11

flip_items(seq_item a, seq_item b)

sortseq<K,I> : 9.3

float_type

POLYGON : 14.6

rat_circle : 14.12

rat_line : 14.11

rat_point : 14.8

rat_ray : 14.10

rat_segment : 14.9

floatf : 7.5

floor(bigfloat x) : 7.3

floor(rational q) : 7.2

flush_buffer()

window : 17.2

flush_buffer(double dx, double dy)

window : 17.2

flush_buffer(double dx, double dy, double x0, double y0, double x1, double y1)

window : 17.2

flush_buffer(double x0, double y0, double x1, double y1)

window : 17.2

Fman : 4.7

four_tuple<A,B,C,D> : 6.18

fourth()

four_tuple<A,B,C,D> : 6.18

from_string(number_string s)

integer : 7.1

front()

list<E> : 8.7

full()

GEN_POLYGON : 14.7

gcd(integer a, integer b) : 7.1

GEN_POLYGON : 14.7

generate()

dynamic_random_variate : 6.10

random_variate : 6.9

Genus(graph G) : 11.22

geo_alg : 14.13

Geometry

delaunay tree : 18.1.3

interval tree : 18.1.3

priority search tree : 18.1.3

range tree : 18.1.3

segment tree : 18.1.3

GeoWin : 17.7

get()

random_source : 6.8

get(constant_da<T> ca, Iter it) : 13.14

get(int x)

array<E> : 8.1

get(node_array_da<T> da, Iter it) : 13.13

get(node_attribute_da<T> ma, Iter it) : 13.16

get(node_member_da<Str,T> ma, Iter it) : 13.15

get_action(long mask)

GeoWin : 17.7

GraphWin : 17.6

get_active_line_width(geo_scene sc)

GeoWin : 17.7

get_active_scene()

GeoWin : 17.7

get_bg_color()

GeoWin : 17.7

get_bg_pixmap()

GeoWin : 17.7

get_bigfloat_error()

real : 7.4

get_bounding_box(double& x0, double& y0, double& x1, double& y1)

GraphWin : 17.6

get_bounding_box(list<node> V, list<edge> E, double& x0, double& y0, double& x1, double& y1)

GraphWin : 17.6

get_button(string s)

window : 17.2

get_button_label(int but)

window : 17.2

get_call_button()

window : 17.2

get_call_item()

window : 17.2

get_call_window()

window : 17.2

get_client_data(int i=0)

window : 17.2

get_color(geo_scene sc)

GeoWin : 17.7

get_cursor()

window : 17.2

get_cyclic_colors(geo_scene sc)

GeoWin : 17.7

get_d3_fcn(geo_scene sc)

GeoWin : 17.7

get_date()

date : 6.19

get_day()

date : 6.19

get_day_in_year()

date : 6.19

get_day_of_week()

date : 6.19

get_directories(string dir) : 6.14

get_directory() : 6.14

get_double_error()

real : 7.4

get_dow_name()

date : 6.19

get_edge()

AdjIt : 13.7

EdgeIt : 13.3

FaceCirc : 13.8

InAdjIt : 13.6

OutAdjIt : 13.5

get_edge_param()

GraphWin : 17.6

get_edges_in_area(double x0, double y0, double x1, double y1)

GraphWin : 17.6

get_edit_edge()

GraphWin : 17.6

get_edit_node()

GraphWin : 17.6

get_edit_slider()

GraphWin : 17.6

get_element_list(list<int>& L)

d_int_set : 8.11

get_entries(string dir) : 6.14

get_environment(string var) : 6.15

get_environment(string var, string& val) : 6.15

get_event(int& val, double& x, double& y)

window : 17.2

get_exponent(void)

bigfloat : 7.3

get_face()

FaceIt : 13.4

get_files(string dir) : 6.14

get_files(string dir, string pattern) : 6.14

get_fill_color(geo_scene sc)

GeoWin : 17.7

get_geowin(geo_scene sc) : 17.7

get_graph()

AdjIt : 13.7

edge_array<E> : 11.8

edge_map<E> : 11.11

EdgeIt : 13.3

face_array<E> : 11.9

face_map<E> : 11.12

FaceCirc : 13.8

FaceIt : 13.4

GraphWin : 17.6

InAdjIt : 13.6

node_array<E> : 11.7

node_map<E> : 11.10

NodeIt : 13.2

OutAdjIt : 13.5

get_graphwin()

window : 17.2

get_grid_dist()

GeoWin : 17.7

window : 17.2

get_grid_mode()

window : 17.2

get_grid_style()

GeoWin : 17.7

window : 17.2

get_height(char* pr)

window : 17.2

get_home_directory() : 6.14

get_hull_dart()

POINT_SET : 15.2

get_hull_edge()

POINT_SET : 15.2

get_in_stack()

GIT_SCC<Out,In,...> : 13.20

get_input_format()

date : 6.19

get_input_format_str()

date : 6.19

get_item(int i)

list<E> : 8.7

get_item(string s)

window : 17.2

get_language()

date : 6.19

get_line_style()

window : 17.2

get_line_style(geo_scene sc)

GeoWin : 17.7

get_line_width()

window : 17.2

get_line_width(geo_scene sc)

GeoWin : 17.7

get_menu(string label)

GraphWin : 17.6

get_message()

GraphWin : 17.6

get_mode()

window : 17.2

get_month()

date : 6.19

get_month_name()

date : 6.19

get_mouse()

window : 17.2

get_mouse(double& x, double& y)

window : 17.2

get_mouse(point& p)

window : 17.2

get_mouse(window*& w, double& x, double& y) : 17.2

get_name(geo_scene sc)

GeoWin : 17.7

get_name(geo_scenegroup gs)

GeoWin : 17.7

get_node()

AdjIt : 13.7

InAdjIt : 13.6

NodeIt : 13.2

OutAdjIt : 13.5

get_node_param()

GraphWin : 17.6

get_node_width()

window : 17.2

get_nodes_in_area(double x0, double y0, double x1, double y1)

GraphWin : 17.6

get_observer()

ObserverNodeIt<Obs,Iter> : 13.11

get_out_stack()

GIT_SCC<Out,In,...> : 13.20

get_output_format()

date : 6.19

get_output_format_str()

date : 6.19

get_param(edge e)

GraphWin : 17.6

get_param(node v)

GraphWin : 17.6

get_pin_point(point& p)

GeoWin : 17.7

get_pixrect(double x1, double y1, double x2, double y2)

window : 17.2

get_point_style(geo_scene sc)

GeoWin : 17.7

get_position(node_array<point>& pos)

GraphWin : 17.6

get_precision()

random_source : 6.8

get_queue()

GIT_BFS<OutAdjI...> : 13.17

GIT_DIJKSTRA<OutAdjI...> : 13.21

GIT_TOPOSORT<OutAdjI...> : 13.19

get_rgb(int& r, int& g, int& b)

color : 17.1

get_scene_with_name(string nm)

GeoWin : 17.7

get_scenegroups()

GeoWin : 17.7

get_scenes()

GeoWin : 17.7

get_scenes(geo_scenegroup gs)

GeoWin : 17.7

get_selected_edges()

GraphWin : 17.6

get_selected_nodes()

GraphWin : 17.6

get_selection_color(geo_scene sc)

GeoWin : 17.7

get_show_grid()

GeoWin : 17.7

get_show_position()

GeoWin : 17.7

get_significant(void)

bigfloat : 7.3

get_significant_length(void)

bigfloat : 7.3

get_stack()

GIT_DFS<OutAdjI...> : 13.18

get_state()

window : 17.2

get_text_color(geo_scene sc)

GeoWin : 17.7

get_text_mode()

window : 17.2

get_visible(geo_scene sc)

GeoWin : 17.7

get_visible_scenes()

GeoWin : 17.7

get_week()

date : 6.19

get_width(char* pr)

window : 17.2

get_window()

GeoWin : 17.7

GraphWin : 17.6

get_window(int but)

window : 17.2

get_window_pixrect()

window : 17.2

get_xmax()

GeoWin : 17.7

GraphWin : 17.6

get_xmin()

GeoWin : 17.7

GraphWin : 17.6

get_year()

date : 6.19

get_ymax()

GeoWin : 17.7

GraphWin : 17.6

get_ymin()

GeoWin : 17.7

GraphWin : 17.6

GIT_BFS<OutAdjI...> : 13.17

GIT_DFS<OutAdjI...> : 13.18

GIT_DIJKSTRA<OutAdjI...> : 13.21

GIT_SCC<Out,In,...> : 13.20

GIT_TOPOSORT<OutAdjI...> : 13.19

gml_graph : 11.25

goback()

gml_graph : 11.25

graph : 11.1

GRAPH<vtype,e...> : 11.2

graph_draw : 12.12

graph_gen : 11.21

graph_misc : 11.22

graph_of(edge e) : 11.1

graph_of(face f) : 11.1

graph_of(node v) : 11.1

GraphWin : 17.6

grid_graph(graph& G, int n) : 11.21

grid_graph(graph& G, node_array<double>& xcoord, node_array<double>& ycoord, int n) : 11.21

guarantee_relative_error(long k)

real : 7.4

h_array<I,E> : 9.7

has_edge()

FaceCirc : 13.8

has_node()

AdjIt : 13.7

InAdjIt : 13.6

OutAdjIt : 13.5

Hash(...) : see User defined parameter types

Hashed Types : see User defined parameter types | see h_array | see map | see map2

Hashing : see User defined parameter types

dynamic and perfect : 18.1.1

with chaining : 18.1.1

hcoord(int i)

d3_rat_point : 16.8

rat_vector : 7.10

vector : 7.6

head()

list<E> : 8.7

node_list : 11.17

slist<E> : 8.8

head(int i)

string : 6.1

height()

window : 17.2

hex_print(ostream& o)

integer : 7.1

hidden_edges()

graph : 11.1

hidden_nodes()

graph : 11.1

hide_edge(edge e)

graph : 11.1

hide_node(node v)

graph : 11.1

hide_node(node v, list<edge>& h_edges)

graph : 11.1

high()

array<E> : 8.1

high1()

array2<E> : 8.2

high2()

array2<E> : 8.2

highword()

integer : 7.1

hilbert(int n, RAT_TYPE x1, RAT_TYPE y1, RAT_TYPE x2, RAT_TYPE y2) : 14.6

homogeneous_linear_solver(integer_matrix M, integer_matrix& spanning_vecs) : 7.9

homogeneous_linear_solver(integer_matrix M, integer_vector& x) : 7.9

identity(int n)

integer_matrix : 7.9

ilog2(bigfloat x) : 7.3

improve_approximation_to(integer q)

real : 7.4

in_current()

GIT_SCC<Out,In,...> : 13.20

in_edges(node v)

graph : 11.1

in_pred(edge e)

graph : 11.1

in_simplex(d3_point p)

d3_simplex : 16.7

in_simplex(d3_rat_point p)

d3_rat_simplex : 16.14

in_succ(edge e)

graph : 11.1

InAdjIt : 13.6

incircle(point a, point b, point c, point d) : 14.1

incircle(rat_point a, rat_point b, rat_point c, rat_point d) : 14.8

indeg(node v)

graph : 11.1

independent_columns(integer_matrix M, array<int>& columns) : 7.9

INDEPENDENT_SET(graph G, list<node>& I) : 12.11

index(d3_point p)

d3_simplex : 16.7

index(d3_rat_point p)

d3_rat_simplex : 16.14

index_type

d_array<I,E> : 9.5

map<I,E> : 9.8

inf(d_vertex v)

tree_collection<I> : 8.15

inf(dic2_item it)

d2_dictionary<K1,K2,I> : 15.1

inf(dic_item it)

dictionary<K,I> : 9.1

inf(edge e)

GRAPH<vtype,e...> : 11.2

PLANAR_MAP<vtype,e...> : 11.6

inf(face f)

PLANAR_MAP<vtype,e...> : 11.6

subdivision<I> : 15.5

inf(is_item it)

interval_set<I> : 15.3

inf(list_item it)

list<E> : 8.7

inf(node v)

GRAPH<vtype,e...> : 11.2

node_pq<P> : 11.19

PLANAR_MAP<vtype,e...> : 11.6

inf(p_dic_item it)

p_dictionary<K,I> : 9.10

inf(partition_item it)

Partition<E> : 8.13

inf(pp_dic_item it)

pp_dictionary<K,I,CMP> : 9.11

inf(pq_item it)

p_queue<P,I> : 10.1

inf(seg_item it)

segment_set<I> : 15.4

inf(seq_item it)

sortseq<K,I> : 9.3

inf(slist_item it)

slist<E> : 8.8

inf_type

dictionary<K,I> : 9.1

p_queue<P,I> : 10.1

sortseq<K,I> : 9.3

init()

edge_map<E> : 11.11

face_map<E> : 11.12

node_map2<E> : 11.14

node_map<E> : 11.10

init(double x0, double x1, double y0)

window : 17.2

init(double x0, double x1, double y0, int d, bool erase=true)

window : 17.2

init(double x1, double x2, double y1, double y2, int r=GEOWIN_MARGIN)

GeoWin : 17.7

init(double xmin, double xmax, double ymin)

GeoWin : 17.7

init(E x)

array<E> : 8.1

init(graph G)

edge_array<E> : 11.8

edge_map<E> : 11.11

face_array<E> : 11.9

face_map<E> : 11.12

node_array<E> : 11.7

node_map2<E> : 11.14

node_map<E> : 11.10

node_matrix<E> : 11.13

init(graph G, E x)

edge_array<E> : 11.8

edge_map<E> : 11.11

face_array<E> : 11.9

face_map<E> : 11.12

node_array<E> : 11.7

node_map2<E> : 11.14

node_map<E> : 11.10

node_matrix<E> : 11.13

init(graph G, int n, E x)

edge_array<E> : 11.8

face_array<E> : 11.9

node_array<E> : 11.7

init(graphtype G)

AdjIt : 13.7

init(graphtype G, nodetype n)

AdjIt : 13.7

init(graphtype G, nodetype n, edgetype e)

AdjIt : 13.7

init(leda_graph G)

EdgeIt : 13.3

FaceCirc : 13.8

FaceIt : 13.4

InAdjIt : 13.6

NodeIt : 13.2

OutAdjIt : 13.5

init(leda_graph G, leda_edge e)

EdgeIt : 13.3

FaceCirc : 13.8

init(leda_graph G, leda_face v)

FaceIt : 13.4

init(leda_graph G, leda_node n)

InAdjIt : 13.6

OutAdjIt : 13.5

init(leda_graph G, leda_node n, leda_edge e)

InAdjIt : 13.6

OutAdjIt : 13.5

init(leda_graph G, leda_node v)

NodeIt : 13.2

init(list<POINT> L)

POINT_SET : 15.2

init(Obs obs, Iter base_it)

ObserverNodeIt<Obs,Iter> : 13.11

init(OutAdjIt s)

GIT_DFS<OutAdjI...> : 13.18

GIT_DIJKSTRA<OutAdjI...> : 13.21

init(Predicate pred, Iter base_it)

FilterNodeIt<Predica...> : 13.9

insert()

NodeIt : 13.2

insert(AdjIt other)

AdjIt : 13.7

insert(double x, double y, I i)

interval_set<I> : 15.3

insert(E x)

set<E> : 8.9

insert(E x, list_item pos, int dir=LEDA::after)

list<E> : 8.7

insert(E x, slist_item pos)

slist<E> : 8.8

insert(edge x)

edge_set : 11.16

insert(geo_scenegroup GS, geo_scene sc)

GeoWin : 17.7

insert(InAdjIt other)

InAdjIt : 13.6

insert(int i, string s1)

string : 6.1

insert(int x)

d_int_set : 8.11

int_set : 8.10

insert(K k, I i)

dictionary<K,I> : 9.1

p_dictionary<K,I> : 9.10

pp_dictionary<K,I,CMP> : 9.11

sortseq<K,I> : 9.3

insert(K1 x, K2 y, I i)

d2_dictionary<K1,K2,I> : 15.1

insert(leda_node v1, leda_node v2)

EdgeIt : 13.3

insert(node v, node w)

node_list : 11.17

insert(node v, P x)

node_pq<P> : 11.19

insert(node w, int p)

b_node_pq<N> : 11.20

insert(node x)

node_set : 11.15

insert(OutAdjIt other)

OutAdjIt : 13.5

insert(P x, I i)

p_queue<P,I> : 10.1

insert(POINT p)

POINT_SET : 15.2

insert(segment s, I i)

segment_set<I> : 15.4

insert_at(seq_item it, K k, I i)

sortseq<K,I> : 9.3

insert_at(seq_item it, K k, I i, int dir)

sortseq<K,I> : 9.3

insert_reverse_edges()

graph : 11.1

inside(d3_point p)

d3_sphere : 16.6

inside(d3_rat_point p)

d3_rat_sphere : 16.13

inside(point p)

circle : 14.5

GEN_POLYGON : 14.7

POLYGON : 14.6

inside(rat_point p)

rat_circle : 14.12

inside_sphere(d3_point a, d3_point b, d3_point c, d3_point d, d3_point e) : 16.1

inside_sphere(d3_rat_point a, d3_rat_point b, d3_rat_point c, d3_rat_point d, d3_rat_point e) : 16.8

insphere(d3_point p)

d3_simplex : 16.7

insphere(d3_rat_point p)

d3_rat_simplex : 16.14

Installation : 5.1

compilation : 5.1.1.2

object code package : 5.1.2

source code package : 5.1.1

uncompress : 5.1

int_item(string s, int& x, const char* hlp=0)

window : 17.2

int_item(string s, int& x, int l, int h, const char* hlp=0)

window : 17.2

int_item(string s, int& x, int l, int h, int step, const char* hlp=0)

window : 17.2

int_item(string s, int& x, int l, int h, int step, void (*F)(int), const char* hlp=0)

window : 17.2

int_item(string s, int& x, int l, int h, void (*F)(int), const char* hlp=0)

window : 17.2

int_set : 8.10

integer : 7.1

integer_matrix : 7.9

integer_vector : 7.8

integrate_function(double (*f)(double), double l, double r, double delta = 1.0e-2) : 7.11.2

intersect(d_int_set T)

d_int_set : 8.11

intersect(set<E> T)

set<E> : 8.9

intersect_halfplane(LINE l)

POLYGON : 14.6

intersection(circle D)

circle : 14.5

intersection(const d3_point p1, const d3_point p2, d3_point& q)

d3_plane : 16.5

intersection(const d3_rat_point p1, const d3_rat_point p2, d3_rat_point& q)

d3_rat_plane : 16.12

intersection(d3_line m)

d3_line : 16.4

intersection(d3_line m, d3_point& p)

d3_line : 16.4

intersection(d3_plane Q, d3_point& i1, d3_point& i2)

d3_plane : 16.5

intersection(d3_rat_line m)

d3_rat_line : 16.10

intersection(d3_rat_line m, d3_rat_point& p)

d3_rat_line : 16.10

intersection(d3_rat_plane Q, d3_rat_point& i1, d3_rat_point& i2)

d3_rat_plane : 16.12

intersection(d3_rat_ray r, d3_rat_point& inter)

d3_rat_ray : 16.9

intersection(d3_rat_segment s)

d3_rat_line : 16.10

intersection(d3_rat_segment s, d3_rat_point& inter)

d3_rat_ray : 16.9

intersection(d3_rat_segment s, d3_rat_point& p)

d3_rat_line : 16.10

intersection(d3_rat_segment t)

d3_rat_segment : 16.11

intersection(d3_rat_segment t, d3_rat_point& p)

d3_rat_segment : 16.11

intersection(d3_ray r, d3_point& inter)

d3_ray : 16.2

intersection(d3_segment s)

d3_line : 16.4

intersection(d3_segment s, d3_point& inter)

d3_ray : 16.2

intersection(d3_segment s, d3_point& p)

d3_line : 16.4

intersection(d3_segment t)

d3_segment : 16.3

intersection(d3_segment t, d3_point& p)

d3_segment : 16.3

intersection(double a, double b)

interval_set<I> : 15.3

intersection(GEN_POLYGON Q)

GEN_POLYGON : 14.7

intersection(line g, point& p)

line : 14.4

intersection(line l)

circle : 14.5

GEN_POLYGON : 14.7

POLYGON : 14.6

segment_set<I> : 15.4

intersection(rat_line g, rat_point& inter)

rat_line : 14.11

intersection(rat_ray s, rat_point& inter)

rat_ray : 14.10

intersection(rat_segment s, rat_point& inter)

rat_line : 14.11

rat_ray : 14.10

intersection(rat_segment t)

rat_segment : 14.9

intersection(rat_segment t, rat_point& p)

rat_segment : 14.9

intersection(rat_segment t, rat_segment& inter)

rat_segment : 14.9

intersection(ray s, point& inter)

ray : 14.3

intersection(segment q)

segment_set<I> : 15.4

intersection(segment s)

circle : 14.5

GEN_POLYGON : 14.7

POLYGON : 14.6

intersection(segment s, point& inter)

line : 14.4

ray : 14.3

intersection(segment t)

segment : 14.2

intersection(segment t, point& p)

segment : 14.2

intersection_of_lines(d3_rat_segment t, d3_rat_point& p)

d3_rat_segment : 16.11

intersection_of_lines(d3_segment t, d3_point& p)

d3_segment : 16.3

intersection_of_lines(rat_segment t, rat_point& p)

rat_segment : 14.9

intersection_of_lines(segment t, point& p)

segment : 14.2

interval_set<I> : 15.3

inv()

matrix : 7.7

inverse()

rational : 7.2

inverse(integer_matrix M, integer& D) : 7.9

inverse(integer_matrix M, integer_matrix& inverse, integer& D, integer_vector& c) : 7.9

invert()

rational : 7.2

is_active(geo_scene sc)

GeoWin : 17.7

Is_Acyclic(graph G) : 11.22

Is_Acyclic(graph G, list<edge>& L) : 11.22

Is_Biconnected(graph G) : 11.22

Is_Biconnected(graph G, node& s) : 11.22

is_bidirected()

graph : 11.1

Is_Bidirected(graph G) : 11.22

Is_Bidirected(graph G, edge_array<edge>& rev) : 11.22

Is_Bipartite(graph G) : 11.22

Is_Bipartite(graph G, list<node>& A, list<node>& B) : 11.22

is_call_enabled(int id)

GraphWin : 17.6

Is_CCW_Ordered(graph G, edge_array<int> dx, edge_array<int> dy) : 12.11

Is_CCW_Ordered(graph G, node_array<int> x, node_array<int> y) : 12.11

Is_Connected(graph G) : 11.22

is_convex()

GEN_POLYGON : 14.7

POLYGON : 14.6

Is_Convex_Subdivision(GRAPH<point,int> G) : 14.13

is_degenerate()

circle : 14.5

d3_rat_simplex : 16.14

d3_rat_sphere : 16.13

d3_simplex : 16.7

d3_sphere : 16.6

rat_circle : 14.12

Is_Delaunay_Diagram(GRAPH<point,int> G, delaunay_voronoi_kind kind) : 14.13

Is_Delaunay_Triangulation(GRAPH<point,int> G, delaunay_voronoi_kind kind) : 14.13

is_diagram_dart(edge e)

POINT_SET : 15.2

is_diagram_edge(edge e)

POINT_SET : 15.2

is_directed()

graph : 11.1

is_directory(string fname) : 6.14

is_enabled(int b)

window : 17.2

is_enabled(panel_item it)

window : 17.2

is_file(string fname) : 6.14

is_hidden(edge e)

graph : 11.1

is_hidden(node v)

graph : 11.1

is_horizontal()

line : 14.4

rat_line : 14.11

rat_ray : 14.10

rat_segment : 14.9

ray : 14.3

segment : 14.2

is_hull_dart(edge e)

POINT_SET : 15.2

is_hull_edge(edge e)

POINT_SET : 15.2

is_last_day_in_month()

date : 6.19

is_leap_year(int y)

date : 6.19

is_line()

rat_circle : 14.12

is_link(string fname) : 6.14

is_long()

integer : 7.1

Is_Loopfree(graph G) : 11.22

is_map()

graph : 11.1

Is_Map(graph G) : 11.22

Is_Planar(graph G) : 11.22

Is_Planar_Map(graph G) : 11.22

Is_Plane_Map(graph G) : 11.22

is_pred()

GIT_DIJKSTRA<OutAdjI...> : 13.21

is_selected(edge e)

GraphWin : 17.6

is_selected(node v)

GraphWin : 17.6

Is_Series_Parallel(graph G) : 11.22

is_simple()

GEN_POLYGON : 14.7

POLYGON : 14.6

Is_Simple(graph G) : 11.22

Is_Simple(graph G, list<edge>& el) : 11.22

Is_Simple_Loopfree(graph G) : 11.22

Is_Simple_Polygon(list<point> L) : 14.13

Is_Simple_Undirected(graph G) : 11.22

is_solvable(integer_matrix M, integer_vector b) : 7.9

Is_Triangulation(GRAPH<point,int> G) : 14.13

Is_Triconnected(graph G) : 11.22

Is_Triconnected(graph G, node& s1, node& s2) : 11.22

is_trivial()

circle : 14.5

d3_rat_segment : 16.11

d3_segment : 16.3

rat_circle : 14.12

rat_segment : 14.9

segment : 14.2

is_undirected()

graph : 11.1

is_valid(int d, month m, int y)

date : 6.19

is_valid(string d, bool swallow=true)

date : 6.19

is_vertical()

line : 14.4

rat_line : 14.11

rat_ray : 14.10

rat_segment : 14.9

ray : 14.3

segment : 14.2

Is_Voronoi_Diagram(GRAPH<circle,point> G, delaunay_voronoi_kind kind) : 14.13

is_weakly_simple()

POLYGON : 14.6

isInf(bigfloat x) : 7.3

isNaN(bigfloat x) : 7.3

isnInf(bigfloat x) : 7.3

isnZero(bigfloat x) : 7.3

ispInf(bigfloat x) : 7.3

ispZero(bigfloat x) : 7.3

isSpecial(bigfloat x) : 7.3

istream : 6

iszero()

integer : 7.1

isZero(bigfloat x) : 7.3

item : 4.5

array<E> : 8.1

d_array<I,E> : 9.5

dictionary<K,I> : 9.1

list<E> : 8.7

map<I,E> : 9.8

p_queue<P,I> : 10.1

sortseq<K,I> : 9.3

iteration

Graph iterator : 4.6

macros : 4.6

STL iterators : 4.6

iterator : 13.1.1

join(d_int_set T)

d_int_set : 8.11

join(graph& H)

graph : 11.1

join(set<E> T)

set<E> : 8.9

join_faces(edge e)

graph : 11.1

key(dic_item it)

dictionary<K,I> : 9.1

key(p_dic_item it)

p_dictionary<K,I> : 9.10

key(pp_dic_item it)

pp_dictionary<K,I,CMP> : 9.11

key(seg_item it)

segment_set<I> : 15.4

key(seq_item it)

sortseq<K,I> : 9.3

key1(dic2_item it)

d2_dictionary<K1,K2,I> : 15.1

key2(dic2_item it)

d2_dictionary<K1,K2,I> : 15.1

key_type

dictionary<K,I> : 9.1

sortseq<K,I> : 9.3

kind()

GEN_POLYGON : 14.7

KURATOWSKI(graph& G, list<node>& V, list<edge>& E, node_array<int>& deg) : 12.11

L^ATEX : 4.7

LARGEST_EMPTY_CIRCLE(list<point> L) : 14.13

last()

list<E> : 8.7

slist<E> : 8.8

STLNodeIt<DataAcc...> : 13.12

last_adj_edge(node v)

graph : 11.1

last_edge()

graph : 11.1

last_face()

graph : 11.1

last_in_edge(node v)

graph : 11.1

last_node()

graph : 11.1

lattice_d3_rat_points(int n, int maxc, list<d3_rat_point>& L) : 16.8

lattice_points(int n, int maxc, list<POINT>& L) : 14.15

lca(vertex v, vertex w)

dynamic_trees : 8.14

ldel : 4.7

leda_allocator<T> : 6.12

leda_assert(bool cond, const char* err_msg, int err_no=0) : 6.13

leda_isspace(char c) : 6.15

LEDA_PREFIX : 5.3

leda_wait(double sec) : 6.15

left(is_item it)

interval_set<I> : 15.3

left_tangent(point p)

circle : 14.5

left_turn(point a, point b, point c) : 14.1

left_turn(rat_point a, rat_point b, rat_point c) : 14.8

length()

d3_segment : 16.3

integer : 7.1

list<E> : 8.7

segment : 14.2

slist<E> : 8.8

string : 6.1

vector : 7.6

lextract : 4.7

line : 14.4

Linear Orders : see User defined parameter types | see dictionary | see sortseq

linear_base(array<rat_vector> A) : 7.10

linear_rank(array<rat_vector> A) : 7.10

linear_solver(integer_matrix M, integer_vector b, integer_vector& x, integer& D) : 7.9

linear_solver(integer_matrix M, integer_vector b, integer_vector& x, integer& D, integer_matrix& spanning_vectors, integer_vector& c) : 7.9

linear_solver(integer_matrix M, integer_vector b, integer_vector& x, integer& D, integer_vector& c) : 7.9

linearly_independent(array<rat_vector> A) : 7.10

link(d_vertex v, d_vertex x)

tree_collection<I> : 8.15

link(vertex v, vertex w, double x, void* e_inf=nil)

dynamic_trees : 8.14

list<E> : 8.7

Lman : 4.7

load_layout(istream& istr)

GraphWin : 17.6

locate(K k)

p_dictionary<K,I> : 9.10

sortseq<K,I> : 9.3

locate(POINT p)

POINT_SET : 15.2

locate_point(point p)

subdivision<I> : 15.5

locate_pred(K k)

pp_dictionary<K,I,CMP> : 9.11

sortseq<K,I> : 9.3

locate_succ(K k)

pp_dictionary<K,I,CMP> : 9.11

sortseq<K,I> : 9.3

log(integer a) : 7.1

lookup(double x, double y)

interval_set<I> : 15.3

lookup(K k)

dictionary<K,I> : 9.1

pp_dictionary<K,I,CMP> : 9.11

sortseq<K,I> : 9.3

lookup(K1 x, K2 y)

d2_dictionary<K1,K2,I> : 15.1

lookup(POINT p)

POINT_SET : 15.2

lookup(segment s)

segment_set<I> : 15.4

low()

array<E> : 8.1

low1()

array2<E> : 8.2

low2()

array2<E> : 8.2

LOWER_CONVEX_HULL(list<point> L) : 14.13

lstyle_item(string s, line_style& x, const char* hlp=0)

window : 17.2

lstyle_item(string s, line_style& x, void(*F)(int), const char* hlp=0)

window : 17.2

lwidth_item(string s, int& x, const char* hlp=0)

window : 17.2

lwidth_item(string s, int& x, void(*F)(int), const char* hlp=0)

window : 17.2

make(void* x=nil)

dynamic_trees : 8.14

Make_Acyclic(graph& G) : 11.22

Make_Biconnected(graph& G) : 11.22

Make_Biconnected(graph& G, list<edge>& L) : 11.22

make_bidirected()

graph : 11.1

Make_Bidirected(graph& G) : 11.22

Make_Bidirected(graph& G, list<edge>& L) : 11.22

make_bidirected(list<edge>& R)

graph : 11.1

make_block()

partition : 8.12

make_block(E x)

Partition<E> : 8.13

Make_Connected(graph& G) : 11.22

Make_Connected(graph& G, list<edge>& L) : 11.22

make_directed()

graph : 11.1

make_invalid()

AdjIt : 13.7

EdgeIt : 13.3

FaceCirc : 13.8

FaceIt : 13.4

InAdjIt : 13.6

NodeIt : 13.2

OutAdjIt : 13.5

make_map()

graph : 11.1

make_map(list<edge>& R)

graph : 11.1

make_menu_bar()

window : 17.2

make_planar_map()

graph : 11.1

make_rep(node v)

node_partition : 11.18

Make_Simple(graph& G) : 11.22

make_undirected()

graph : 11.1

maketree(I x)

tree_collection<I> : 8.15

Manual Page : 4.2

Manual Production : 4.7

map2<I1,I2,E> : 9.9

map<I,E> : 9.8

markov_chain : 11.23

matrix : 7.7

max()

int_set : 8.10

list<E> : 8.7

max(int (*cmp)(E, E ))

list<E> : 8.7

MAX_CARD_BIPARTITE_MATCHING(graph& G) : 12.6

MAX_CARD_BIPARTITE_MATCHING(graph& G, list<node> A, list<node> B) : 12.6

MAX_CARD_BIPARTITE_MATCHING(graph& G, list<node> A, list<node> B, node_array<bool>& NC) : 12.6

MAX_CARD_BIPARTITE_MATCHING(graph& G, node_array<bool>& NC) : 12.6

MAX_CARD_MATCHING(graph G, int heur = 0) : 12.8

MAX_CARD_MATCHING(graph G, node_array<int>& OSC, int heur = 0) : 12.8

max_flow : 12.3

max_flow_gen_AMO(GRAPH<int,int>& G, node& s, node& t, int n) : 12.3

max_flow_gen_CG1(GRAPH<int,int>& G, node& s, node& t, int n) : 12.3

max_flow_gen_CG2(GRAPH<int,int>& G, node& s, node& t, int n) : 12.3

max_flow_gen_rand(GRAPH<int,int>& G, node& s, node& t, int n, int m) : 12.3

MAX_FLOW_SCALE_CAPS(graph G, node s, edge_array<double>& cap) : 12.3

max_item()

sortseq<K,I> : 9.3

max_key1()

d2_dictionary<K1,K2,I> : 15.1

max_key2()

d2_dictionary<K1,K2,I> : 15.1

max_size()

leda_allocator<T> : 6.12

maximal_planar_graph(graph& G, int n) : 11.21

maximal_planar_map(graph& G, int n) : 11.21

mc_matching : 12.8

mcb_matching : 12.6

member(E x)

set<E> : 8.9

member(edge x)

edge_set : 11.16

member(int x)

d_int_set : 8.11

int_set : 8.10

member(node v)

node_list : 11.17

node_pq<P> : 11.19

member(node x)

node_set : 11.15

menu : 17.4

merge(list<E>& L1)

list<E> : 8.7

merge(list<E>& L1, int (*cmp)(E, E ))

list<E> : 8.7

merge(sortseq<K,I>& S1)

sortseq<K,I> : 9.3

merge_nodes(edge e1, node v2)

graph : 11.1

merge_nodes(node v1, node v2)

graph : 11.1

merge_sort()

list<E> : 8.7

merge_sort(int (*cmp)(E, E ))

list<E> : 8.7

message(const char* msg)

GraphWin : 17.6

message(string msg)

GeoWin : 17.7

message(string s)

window : 17.2

midpoint(d3_point a, d3_point b) : 16.1

midpoint(d3_rat_point a, d3_rat_point b) : 16.8

midpoint(point a, point b) : 14.1

midpoint(rat_point a, rat_point b) : 14.8

min()

int_set : 8.10

list<E> : 8.7

min(int (*cmp)(E, E ))

list<E> : 8.7

MIN_AREA_ANNULUS(list<point> L, point& center, point& ipoint, point& opoint, line& l1) : 14.13

min_cost_flow : 12.4

MIN_COST_FLOW(graph& G, edge_array<int> cap, edge_array<int> cost, node_array<int> supply, edge_array<int>& flow) : 12.4

MIN_COST_FLOW(graph& G, edge_array<int> lcap, edge_array<int> ucap, edge_array<int> cost, node_array<int> supply, edge_array<int>& flow) : 12.4

MIN_COST_MAX_FLOW(graph& G, node s, node t, edge_array<int> cap, edge_array<int> cost, edge_array<int>& flow) : 12.4

min_cut : 12.5

MIN_CUT(graph G, edge_array<int> weight) : 12.5

MIN_CUT(graph G, edge_array<int> weight, list<node>& C, bool use_heuristic = true) : 12.5

min_item()

sortseq<K,I> : 9.3

min_key1()

d2_dictionary<K1,K2,I> : 15.1

min_key2()

d2_dictionary<K1,K2,I> : 15.1

min_span : 12.10

MIN_SPANNING_TREE(graph G, edge_array<int> cost) : 12.10

MIN_SPANNING_TREE(graph G, int (*cmp)(edge, edge )) : 12.10

MIN_SPANNING_TREE(graph G, leda_cmp_base<edge> cmp) : 12.10

MIN_SPANNING_TREE(list<point> L, GRAPH<point,int>& T) : 14.13

MIN_WIDTH_ANNULUS(list<point> L, point& center, point& ipoint, point& opoint, line& l1, line& l2) : 14.13

mincost(vertex v)

dynamic_trees : 8.14

minimize_function(double (*f)(double), double& xmin, double tol = 1.0e-10) : 7.11.1

MINIMUM_RATIO_CYCLE(graph& G, edge_array<int> c, edge_array<int> p, list<edge>& C_star) : 12.2

minimum_spanning_tree()

POINT_SET : 15.2

MINKOWSKI_DIFF(gen_polygon P, polygon R) : 14.13

MINKOWSKI_DIFF(polygon P, polygon R) : 14.13

MINKOWSKI_SUM(gen_polygon P, polygon R) : 14.13

MINKOWSKI_SUM(polygon P, polygon R) : 14.13

misc : 6.15

months_until(date D2)

date : 6.19

move_edge(edge e, edge e1, edge e2, int d1=LEDA::after, int d2=LEDA::after)

graph : 11.1

move_edge(edge e, edge e1, node w, int d=LEDA::after)

graph : 11.1

move_edge(edge e, node v, edge e2, int d=LEDA::after)

graph : 11.1

move_edge(edge e, node v, node w)

graph : 11.1

move_to_back(list_item it)

list<E> : 8.7

move_to_front(list_item it)

list<E> : 8.7

move_to_rear(list_item it)

list<E> : 8.7

msg_clear()

GeoWin : 17.7

msg_close()

GeoWin : 17.7

msg_open(string msg)

GeoWin : 17.7

MULMULEY_SEGMENTS(list<segment> S, GRAPH<point,segment>& G, bool embed=false) : 14.13

mw_matching : 12.9

MWA_SCALE_WEIGHTS(graph G, edge_array<double>& c) : 12.7

mwb_matching : 12.7

MWBM_SCALE_WEIGHTS(graph G, edge_array<double>& c) : 12.7

my_sortseq(seq_item it)

sortseq<K,I> : 9.3

n_gon(int n, CIRCLE C, double epsilon) : 14.6

Name space : 5.3

nearest_neighbor(node w)

POINT_SET : 15.2

nearest_neighbor(POINT p)

POINT_SET : 15.2

nearest_neighbors(node w, int k)

POINT_SET : 15.2

nearest_neighbors(POINT p, int k)

POINT_SET : 15.2

negate()

rational : 7.2

new_edge(edge e, node w, etype x, int dir=LEDA::after)

GRAPH<vtype,e...> : 11.2

new_edge(edge e, node w, int dir=LEDA::after)

graph : 11.1

new_edge(edge e1, edge e2)

planar_map : 11.5

new_edge(edge e1, edge e2, etype x, int d1=LEDA::after, int d2=LEDA::after)

GRAPH<vtype,e...> : 11.2

new_edge(edge e1, edge e2, ftype y)

PLANAR_MAP<vtype,e...> : 11.6

new_edge(edge e1, edge e2, int d1=LEDA::after, int d2=LEDA::after)

graph : 11.1

new_edge(node v, edge e, etype x, int dir=LEDA::after)

GRAPH<vtype,e...> : 11.2

new_edge(node v, edge e, int dir=LEDA::after)

graph : 11.1

new_edge(node v, edge e, node w, etype x, int d=LEDA::after)

GRAPH<vtype,e...> : 11.2

new_edge(node v, edge e, node w, int d=LEDA::after)

graph : 11.1

new_edge(node v, edge e1, node w, edge e2, etype x, int d1=LEDA::after, int d2=LEDA::after)

GRAPH<vtype,e...> : 11.2

new_edge(node v, edge e1, node w, edge e2, int d1=LEDA::after, int d2=LEDA::after)

graph : 11.1

new_edge(node v, node w)

graph : 11.1

GraphWin : 17.6

new_edge(node v, node w, edge e, int d=LEDA::after)

graph : 11.1

new_edge(node v, node w, etype x)

GRAPH<vtype,e...> : 11.2

new_edge(node v, node w, list<point> P)

GraphWin : 17.6

new_map_edge(edge e1, edge e2)

graph : 11.1

new_node()

graph : 11.1

new_node(face f)

planar_map : 11.5

new_node(face f, vtype x)

PLANAR_MAP<vtype,e...> : 11.6

new_node(list<edge> el)

planar_map : 11.5

new_node(list<edge>& el, vtype x)

PLANAR_MAP<vtype,e...> : 11.6

new_node(node u, int dir)

graph : 11.1

new_node(node u, vtype x, int dir)

GRAPH<vtype,e...> : 11.2

new_node(point p)

GraphWin : 17.6

new_node(vtype x)

GRAPH<vtype,e...> : 11.2

new_scenegroup(string name)

GeoWin : 17.7

new_scenegroup(string name, list<geo_scene> LS)

GeoWin : 17.7

next()

GIT_BFS<OutAdjI...> : 13.17

GIT_DFS<OutAdjI...> : 13.18

GIT_DIJKSTRA<OutAdjI...> : 13.21

GIT_SCC<Out,In,...> : 13.20

GIT_TOPOSORT<OutAdjI...> : 13.19

next_face_edge(edge e)

graph : 11.1

next_unseen()

GIT_DFS<OutAdjI...> : 13.18

node_array<E> : 11.7

node_array_da<T> : 13.13

node_attribute_da<T> : 13.16

node_data()

GRAPH<vtype,e...> : 11.2

node_list : 11.17

node_map2<E> : 11.14

node_map<E> : 11.10

node_matrix<E> : 11.13

node_member_da<Str,T> : 13.15

node_partition : 11.18

node_pq<P> : 11.19

node_set : 11.15

NodeIt : 13.2

norm()

TRANSFORM : 14.14

vector : 7.6

normal()

d3_plane : 16.5

d3_rat_plane : 16.12

normal_project(d3_point q)

d3_plane : 16.5

normal_project(d3_rat_point q)

d3_rat_plane : 16.12

normalize()

GEN_POLYGON : 14.7

POLYGON : 14.6

rat_circle : 14.12

rat_line : 14.11

rat_point : 14.8

rat_ray : 14.10

rat_segment : 14.9

rational : 7.2

noweb : 4.7

number_of_blocks()

node_partition : 11.18

partition : 8.12

number_of_edges()

graph : 11.1

number_of_faces()

graph : 11.1

number_of_nodes()

graph : 11.1

number_of_steps()

dynamic_markov_chain : 11.24

markov_chain : 11.23

number_of_visits(node v)

dynamic_markov_chain : 11.24

markov_chain : 11.23

numerator()

rational : 7.2

ObserverNodeIt<Obs,Iter> : 13.11

on_boundary(POINT p)

GEN_POLYGON : 14.7

POLYGON : 14.6

on_circle(rat_point a, rat_point b, rat_point c, rat_point d) : 14.8

on_sphere(d3_point a, d3_point b, d3_point c, d3_point d, d3_point e) : 16.1

on_sphere(d3_rat_point a, d3_rat_point b, d3_rat_point c, d3_rat_point d, d3_rat_point e) : 16.8

open()

GraphWin : 17.6

open(int x = window::center, int y = window::center)

panel : 17.3

open(int x, int y)

GraphWin : 17.6

open(window& W, int x, int y)

menu : 17.4

open(window& W, int x=window::center, int y=window::center)

panel : 17.3

open_panel(panel& P)

GeoWin : 17.7

GraphWin : 17.6

operator>> : see User defined parameter types

operator<< : see User defined parameter types

opposite(node v, edge e)

graph : 11.1

orientation()

circle : 14.5

POLYGON : 14.6

rat_circle : 14.12

orientation(d3_plane p, d3_point q) : 16.5

orientation(d3_point a, d3_point b, d3_point c, d3_point d) : 16.1

orientation(d3_rat_plane p, d3_rat_point q) : 16.12

orientation(d3_rat_point a, d3_rat_point b, d3_rat_point c, d3_rat_point d) : 16.8

orientation(edge e, POINT p)

POINT_SET : 15.2

orientation(line l, point p) : 14.4

orientation(point a, point b, point c) : 14.1

orientation(rat_line l, rat_point p) : 14.11

orientation(rat_point a, rat_point b, rat_point c) : 14.8

orientation(rat_ray r, rat_point p) : 14.10

orientation(rat_segment s, rat_point p) : 14.9

orientation(ray r, point p) : 14.3

orientation(segment s, point p) : 14.2

ORTHO_DRAW(graph G0, node_array<double>& xpos, node_array<double>& ypos, node_array<double>& xrad, node_array<double>& yrad, edge_array<list<double> >& xbends, edge_array<list<double> >& ybends, edge_array<double>& xsanch, edge_array<double>& ysanch, edge_array<double>& xtanch, edge_array<double>& ytanch) : 12.12

ORTHO_EMBEDDING(graph G, edge_array<int> maxbends, node_array<int>& xcoord, node_array<int>& ycoord, edge_array<list<int> >& xbends, edge_array<list<int> >& ybends) : 12.12

ORTHO_EMBEDDING(graph G, node_array<int>& xpos, node_array<int>& ypos, edge_array<list<int> >& xbends, edge_array<list<int> >& ybends) : 12.12

ostream : 6

out_current()

GIT_SCC<Out,In,...> : 13.20

out_edges(node v)

graph : 11.1

OutAdjIt : 13.5

outcircle(point a, point b, point c, point d) : 14.1

outcircle(rat_point a, rat_point b, rat_point c, rat_point d) : 14.8

outdeg(node v)

graph : 11.1

outside(d3_point p)

d3_sphere : 16.6

outside(d3_rat_point p)

d3_rat_sphere : 16.13

outside(point p)

circle : 14.5

GEN_POLYGON : 14.7

POLYGON : 14.6

outside(rat_point p)

rat_circle : 14.12

outside_sphere(d3_point a, d3_point b, d3_point c, d3_point d, d3_point e) : 16.1

outside_sphere(d3_rat_point a, d3_rat_point b, d3_rat_point c, d3_rat_point d, d3_rat_point e) : 16.8

p_bisector(rat_point p, rat_point q) : 14.11

p_dictionary<K,I> : 9.10

p_queue<P,I> : 10.1

panel : 17.3

parallel(d3_plane Q)

d3_plane : 16.5

parallel(d3_rat_plane Q)

d3_rat_plane : 16.12

parallel(segment s1, segment s2) : 14.2

parent(d_vertex v)

tree_collection<I> : 8.15

parent(vertex v)

dynamic_trees : 8.14

parse(const char* filename)

gml_graph : 11.25

parse(istream& ins)

gml_graph : 11.25

parse_string(string s)

gml_graph : 11.25

partition : 8.12

Partition<E> : 8.13

PATH : 4.7

Perl : 4.7

permute()

array<E> : 8.1

list<E> : 8.7

permute(int l, int h)

array<E> : 8.1

permute(list_item* I)

list<E> : 8.7

perpendicular(point p)

line : 14.4

segment : 14.2

perpendicular(rat_point p)

rat_line : 14.11

rat_segment : 14.9

place_into_box(double x0, double y0, double x1, double y1)

GraphWin : 17.6

place_into_win()

GraphWin : 17.6

PLANAR(graph& , bool embed=false) : 12.11

PLANAR(graph& G, list<edge>& el, bool embed=false) : 12.11

planar_map : 11.5

PLANAR_MAP<vtype,e...> : 11.6

plane_graph_alg : 12.11

plot_xy(double x0, double x1, win_draw_func F, color c=window::fgcol)

window : 17.2

plot_yx(double y0, double y1, win_draw_func F, color c=window::fgcol)

window : 17.2

point : 14.1

point generators : 14.15

point1()

circle : 14.5

d3_line : 16.4

d3_plane : 16.5

d3_rat_line : 16.10

d3_rat_plane : 16.12

d3_rat_ray : 16.9

d3_rat_simplex : 16.14

d3_rat_sphere : 16.13

d3_ray : 16.2

d3_simplex : 16.7

d3_sphere : 16.6

line : 14.4

rat_circle : 14.12

rat_line : 14.11

rat_ray : 14.10

ray : 14.3

point2()

circle : 14.5

d3_line : 16.4

d3_plane : 16.5

d3_rat_line : 16.10

d3_rat_plane : 16.12

d3_rat_ray : 16.9

d3_rat_simplex : 16.14

d3_rat_sphere : 16.13

d3_ray : 16.2

d3_simplex : 16.7

d3_sphere : 16.6

line : 14.4

rat_circle : 14.12

rat_line : 14.11

rat_ray : 14.10

ray : 14.3

point3()

circle : 14.5

d3_plane : 16.5

d3_rat_plane : 16.12

d3_rat_simplex : 16.14

d3_rat_sphere : 16.13

d3_simplex : 16.7

d3_sphere : 16.6

rat_circle : 14.12

point4()

d3_rat_simplex : 16.14

d3_rat_sphere : 16.13

d3_simplex : 16.7

d3_sphere : 16.6

point_on_circle(double alpha, double epsilon)

rat_circle : 14.12

point_on_circle(double alpha, double=0)

circle : 14.5

point_on_positive_side(d3_point a, d3_point b, d3_point c) : 16.1

point_on_positive_side(d3_rat_point a, d3_rat_point b, d3_rat_point c) : 16.8

POINT_SET : 15.2

point_type

circle : 14.5

d3_rat_simplex : 16.14

d3_simplex : 16.7

line : 14.4

point : 14.1

POLYGON : 14.6

rat_circle : 14.12

rat_line : 14.11

rat_point : 14.8

rat_ray : 14.10

rat_segment : 14.9

ray : 14.3

segment : 14.2

points()

POINT_SET : 15.2

points_on_segment(SEGMENT s, int n, list<POINT>& L) : 14.15

POLYGON : 14.6

polygons()

GEN_POLYGON : 14.7

pop()

b_queue<E> : 8.6

b_stack<E> : 8.5

list<E> : 8.7 | 8.7

node_list : 11.17

queue<E> : 8.4

slist<E> : 8.8

stack<E> : 8.3

pop_back()

list<E> : 8.7

pop_front()

list<E> : 8.7

pop_last()

node_list : 11.17

pos(node v)

POINT_SET : 15.2

pos(string s1)

string : 6.1

pos(string s1, int i)

string : 6.1

pos_source(edge e)

POINT_SET : 15.2

pos_target(edge e)

POINT_SET : 15.2

position(node v)

subdivision<I> : 15.5

pow(rational q, int n) : 7.2

pow(rational q, integer a) : 7.2

pow2(integer p) : 7.3

powi(real x, int n) : 7.4

pp_dictionary<K,I,CMP> : 9.11

pred(K k)

sortseq<K,I> : 9.3

pred(list_item it)

list<E> : 8.7

pred(node v)

node_list : 11.17

pred(seq_item x)

sortseq<K,I> : 9.3

pred_edge(edge e)

graph : 11.1

pred_face(face f)

graph : 11.1

pred_face_edge(edge e)

graph : 11.1

pred_node(node v)

graph : 11.1

print()

matrix : 7.7

vector : 7.6

print(char space = ' ')

array<E> : 8.1

list<E> : 8.7

print(ostream& O = cout)

graph : 11.1

print(ostream& O)

matrix : 7.7

vector : 7.6

print(ostream& O, char space = ' ')

array<E> : 8.1

list<E> : 8.7

print(ostream& out, string s, char c=' ')

sortseq<K,I> : 9.3

print(string header, char space = ' ')

list<E> : 8.7

print(string s, char c=' ')

sortseq<K,I> : 9.3

print(string s, char space = ' ')

array<E> : 8.1

print(string s, ostream& O = cout)

graph : 11.1

print_edge(edge e, ostream& O = cout)

graph : 11.1

print_face(face f)

graph : 11.1

print_node(node v, ostream& O = cout)

graph : 11.1

print_statistics() : 6.15

prio(node v)

node_pq<P> : 11.19

prio(pq_item it)

p_queue<P,I> : 10.1

prio_type

p_queue<P,I> : 10.1

Priority Queues

Emde-Boas tree : 18.1.2

Fibonnacci heap : 18.1.2

k-nary heap : 18.1.2

monotonic heap : 18.1.2

pairing heap : 18.1.2

project(d3_point p, d3_point q, d3_point v)

d3_segment : 16.3

project(d3_point p, d3_point q, d3_point v, d3_line& m)

d3_line : 16.4

project(d3_point p, d3_point q, d3_point v, d3_ray& m)

d3_ray : 16.2

project(d3_rat_point p, d3_rat_point q, d3_rat_point v)

d3_rat_segment : 16.11

project(d3_rat_point p, d3_rat_point q, d3_rat_point v, d3_rat_line& m)

d3_rat_line : 16.10

project(d3_rat_point p, d3_rat_point q, d3_rat_point v, d3_rat_ray& m)

d3_rat_ray : 16.9

project_xy()

d3_point : 16.1

d3_rat_point : 16.8

d3_rat_segment : 16.11

d3_segment : 16.3

project_xy(line& m)

d3_line : 16.4

project_xy(rat_line& m)

d3_rat_line : 16.10

project_xy(rat_ray& m)

d3_rat_ray : 16.9

project_xy(ray& m)

d3_ray : 16.2

project_xz()

d3_point : 16.1

d3_rat_point : 16.8

d3_rat_segment : 16.11

d3_segment : 16.3

project_xz(line& m)

d3_line : 16.4

project_xz(rat_line& m)

d3_rat_line : 16.10

project_xz(rat_ray& m)

d3_rat_ray : 16.9

project_xz(ray& m)

d3_ray : 16.2

project_yz()

d3_point : 16.1

d3_rat_point : 16.8

d3_rat_segment : 16.11

d3_segment : 16.3

project_yz(line& m)

d3_line : 16.4

project_yz(rat_line& m)

d3_rat_line : 16.10

project_yz(rat_ray& m)

d3_rat_ray : 16.9

project_yz(ray& m)

d3_ray : 16.2

ps_file : 17.5

pstyle_item(string s, point_style& x, const char* hlp=0)

window : 17.2

pstyle_item(string s, point_style& x, void(*F)(int), const char* hlp=0)

window : 17.2

push(E x)

b_stack<E> : 8.5

list<E> : 8.7

slist<E> : 8.8

stack<E> : 8.3

push(node v)

node_list : 11.17

push_back(E x)

list<E> : 8.7

push_front(E x)

list<E> : 8.7

put_back_event() : 17.2

put_bitmap(double x, double y, char* bm, color c=window::fgcol)

window : 17.2

put_pixrect(char* pr)

window : 17.2

put_pixrect(double x, double y, char* pr)

window : 17.2

put_pixrect(double x, double y, char* pr, int x0, int y0, int w, int h)

window : 17.2

put_pixrect(point p, char* pr)

window : 17.2

queue<E> : 8.4

radius()

circle : 14.5

d3_sphere : 16.6

random(int n)

integer : 7.1

random_bigraph(graph& G, int a, int b, int m, list<node>& A, list<node>& B, int k = 1) : 11.21

random_d3_rat_point_in_ball(int R) : 16.8

random_d3_rat_point_in_cube(int maxc) : 16.8

random_d3_rat_point_in_disc(int R) : 16.8

random_d3_rat_point_in_square(int maxc) : 16.8

random_d3_rat_point_in_unit_ball(int D = 16383) : 16.8

random_d3_rat_point_in_unit_cube(int D = 16383) : 16.8

random_d3_rat_point_on_circle(int R) : 16.8

random_d3_rat_point_on_paraboloid(int maxc) : 16.8

random_d3_rat_point_on_sphere(int R) : 16.8

random_d3_rat_point_on_unit_circle(int D = 16383) : 16.8

random_d3_rat_point_on_unit_sphere(int D = 16383) : 16.8

random_d3_rat_points_in_ball(int n, int R, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_in_cube(int n, int maxc, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_in_disc(int n, int R, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_in_square(int n, int maxc, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_in_unit_ball(int n, int D, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_in_unit_ball(int n, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_in_unit_cube(int n, int D, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_in_unit_cube(int n, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_on_circle(int m, int R, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_on_paraboloid(int n, int maxc, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_on_segment(int n, int maxc, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_on_sphere(int m, int R, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_on_unit_circle(int m, int D, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_on_unit_circle(int m, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_on_unit_sphere(int m, int D, list<d3_rat_point>& L) : 16.8

random_d3_rat_points_on_unit_sphere(int m, list<d3_rat_point>& L) : 16.8

random_graph(graph& G, int n, double p) : 11.21

random_graph(graph& G, int n, int m) : 11.21

random_graph(graph& G, int n, int m, bool no_anti_parallel_edges, bool loopfree, bool no_parallel_edges) : 11.21

random_graph_noncompact(graph& G, int n, int m) : 11.21

random_planar_graph(graph& G, int n) : 11.21

random_planar_graph(graph& G, int n, int m) : 11.21

random_planar_graph(graph& G, node_array<double>& xcoord, node_array<double>& ycoord, int n) : 11.21

random_planar_graph(graph& G, node_array<double>& xcoord, node_array<double>& ycoord, int n, int m) : 11.21

random_planar_map(graph& G, int n, int m) : 11.21

random_planar_map(graph& G, node_array<double>& xcoord, node_array<double>& ycoord, int n, int m) : 11.21

random_point_in_ball(POINT& p, int R) : 14.15

random_point_in_cube(POINT& p, int maxc) : 14.15

random_point_in_disc(POINT& p, int R) : 14.15

random_point_in_square(POINT& p, int maxc) : 14.15

random_point_in_unit_ball(POINT& p, int D = (1<<30) - 1) : 14.15

random_point_in_unit_cube(POINT& p, int D = (1<<30) - 1) : 14.15

random_point_in_unit_disc(POINT& p, int D = (1<<30) - 1) : 14.15

random_point_in_unit_square(POINT& p, int D = (1<<30) - 1) : 14.15

random_point_near_circle(POINT& p, int R) : 14.15

random_point_near_sphere(POINT& p, int R) : 14.15

random_point_near_unit_circle(POINT& p, int D = (1<<30) - 1) : 14.15

random_point_near_unit_sphere(POINT& p, int D = (1<<30) - 1) : 14.15

random_point_on_circle(POINT& p, int R, int C = 1000000) : 14.15

random_point_on_paraboloid(POINT& p, int maxc) : 14.15

random_point_on_segment(POINT& p, SEGMENT s) : 14.15

random_point_on_sphere(POINT& p, int R) : 14.15

random_point_on_unit_circle(POINT& p, int C = 1000000) : 14.15

random_point_on_unit_sphere(POINT& p, int D = (1<<30) - 1) : 14.15

random_points_in_ball(int n, int R, list<POINT>& L) : 14.15

random_points_in_cube(int n, int maxc, list<POINT>& L) : 14.15

random_points_in_disc(int n, int R, list<POINT>& L) : 14.15

random_points_in_square(int n, int maxc, list<POINT>& L) : 14.15

random_points_in_unit_ball(int n, int D, list<POINT>& L) : 14.15

random_points_in_unit_ball(int n, list<POINT>& L) : 14.15

random_points_in_unit_cube(int n, int D, list<POINT>& L) : 14.15

random_points_in_unit_cube(int n, list<POINT>& L) : 14.15

random_points_in_unit_disc(int n, int D, list<POINT>& L) : 14.15

random_points_in_unit_disc(int n, list<POINT>& L) : 14.15

random_points_in_unit_square(int n, int D, list<POINT>& L) : 14.15

random_points_in_unit_square(int n, list<POINT>& L) : 14.15

random_points_near_circle(int n, int R, list<POINT>& L) : 14.15

random_points_near_sphere(int n, int R, list<POINT>& L) : 14.15

random_points_near_unit_circle(int n, int D, list<POINT>& L) : 14.15

random_points_near_unit_circle(int n, list<POINT>& L) : 14.15

random_points_near_unit_sphere(int n, int D, list<POINT>& L) : 14.15

random_points_near_unit_sphere(int n, list<POINT>& L) : 14.15

random_points_on_circle(int n, int R, list<POINT>& L, int C = 1000000) : 14.15

random_points_on_diagonal(int n, int maxc, list<POINT>& L) : 14.15

random_points_on_paraboloid(int n, int maxc, list<POINT>& L) : 14.15

random_points_on_segment(SEGMENT s, int n, list<POINT>& L) : 14.15

random_points_on_sphere(int n, int R, list<POINT>& L) : 14.15

random_points_on_unit_circle(int n, list<POINT>& L, int C = 1000000) : 14.15

random_points_on_unit_sphere(int n, int D, list<POINT>& L) : 14.15

random_points_on_unit_sphere(int n, list<POINT>& L) : 14.15

random_simple_graph(graph& G, int n, int m) : 11.21

random_simple_loopfree_graph(graph& G, int n, int m) : 11.21

random_simple_undirected_graph(graph& G, int n, int m) : 11.21

random_source : 6.8

random_sp_graph(graph& G, int n, int m) : 11.21

random_variate : 6.9

range_search(CIRCLE C)

POINT_SET : 15.2

range_search(K1 x0, K1 x1, K2 y0, K2 y1)

d2_dictionary<K1,K2,I> : 15.1

range_search(node v, POINT p)

POINT_SET : 15.2

range_search(POINT a, POINT b)

POINT_SET : 15.2

range_search(POINT a, POINT b, POINT c)

POINT_SET : 15.2

rank(E x)

list<E> : 8.7

rank(integer_matrix M) : 7.9

rat_circle : 14.12

rat_line : 14.11

rat_point : 14.8

rat_ray : 14.10

rat_segment : 14.9

rat_vector : 7.10

rational : 7.2

ray : 14.3

read()

array<E> : 8.1

matrix : 7.7

vector : 7.6

read(char delim = ' ')

string : 6.1

read(char delim = '')

list<E> : 8.7

read(geo_scene sc, istream& is)

GeoWin : 17.7

read(istream& I = cin)

graph : 11.1

read(istream& I)

array<E> : 8.1

list<E> : 8.7

matrix : 7.7

vector : 7.6

read(istream& I, char delim = ' ')

string : 6.1

read(istream& I, char delim)

list<E> : 8.7

read(string fname)

GRAPH<vtype,e...> : 11.2

read(string prompt, char delim = '')

list<E> : 8.7

read(string s)

array<E> : 8.1

graph : 11.1

read_char(string s) : 6.15

read_defaults(string fname)

GraphWin : 17.6

read_event()

window : 17.2

read_event(int& val, double& x, double& y)

window : 17.2

read_event(int& val, double& x, double& y, unsigned long& t)

window : 17.2

read_event(int& val, double& x, double& y, unsigned long& t, int timeout)

window : 17.2

read_file()

string : 6.1

read_file(istream& I)

string : 6.1

read_gml(istream& I = cin)

graph : 11.1

read_gml(istream& in)

GraphWin : 17.6

read_gml(string fname, bool ask_override=false)

GraphWin : 17.6

read_gml(string s)

graph : 11.1

read_gml_string(string s)

GraphWin : 17.6

read_gw(istream& in)

GraphWin : 17.6

read_gw(string fname)

GraphWin : 17.6

read_int(string p)

window : 17.2

read_int(string s) : 6.15

read_line()

string : 6.1

read_line(istream& I)

string : 6.1

read_mouse()

window : 17.2

read_mouse(double x0, double y0, int timeout1, int timeout2, bool& double_click, bool& drag)

window : 17.2

read_mouse(double& x, double& y)

window : 17.2

read_mouse(point p, int timeout1, int timeout2, bool& double_click, bool& drag)

window : 17.2

read_mouse(point& p)

window : 17.2

read_mouse(window*& w, double& x, double& y) : 17.2

read_mouse_circle(double x0, double y0, double& x, double& y)

window : 17.2

read_mouse_circle(point p, point& q)

window : 17.2

read_mouse_line(double x0, double y0, double& x, double& y)

window : 17.2

read_mouse_line(point p, point& q)

window : 17.2

read_mouse_ray(double x0, double y0, double& x, double& y)

window : 17.2

read_mouse_ray(point p, point& q)

window : 17.2

read_mouse_rect(double x0, double y0, double& x, double& y)

window : 17.2

read_mouse_rect(point p, point& q)

window : 17.2

read_mouse_seg(double x0, double y0, double& x, double& y)

window : 17.2

read_mouse_seg(point p, point& q)

window : 17.2

read_panel(string h, int n, string* S)

window : 17.2

read_polygon()

window : 17.2

read_real(string p)

window : 17.2

read_real(string s) : 6.15

read_string(string p)

window : 17.2

read_string(string s) : 6.15

read_vpanel(string h, int n, string* S)

window : 17.2

real : 7.4

redraw()

GeoWin : 17.7

GraphWin : 17.6

window : 17.2

redraw_panel()

window : 17.2

redraw_panel(panel_item it)

window : 17.2

reflect(d3_plane Q)

d3_plane : 16.5

reflect(d3_point p)

d3_line : 16.4

d3_ray : 16.2

d3_segment : 16.3

d3_simplex : 16.7

reflect(d3_point p, d3_point q, d3_point v)

d3_line : 16.4

d3_ray : 16.2

d3_segment : 16.3

d3_simplex : 16.7

reflect(d3_point q)

d3_plane : 16.5

d3_point : 16.1

reflect(d3_point q, d3_point r, d3_point s)

d3_point : 16.1

reflect(d3_rat_plane Q)

d3_rat_plane : 16.12

reflect(d3_rat_point p)

d3_rat_line : 16.10

d3_rat_ray : 16.9

d3_rat_segment : 16.11

d3_rat_simplex : 16.14

reflect(d3_rat_point p, d3_rat_point q, d3_rat_point r)

d3_rat_point : 16.8

reflect(d3_rat_point p, d3_rat_point q, d3_rat_point v)

d3_rat_line : 16.10

d3_rat_ray : 16.9

d3_rat_segment : 16.11

d3_rat_simplex : 16.14

reflect(d3_rat_point q)

d3_rat_plane : 16.12

d3_rat_point : 16.8

reflect(point p)

circle : 14.5

GEN_POLYGON : 14.7

POLYGON : 14.6

ray : 14.3

segment : 14.2

reflect(point p, point q)

circle : 14.5

GEN_POLYGON : 14.7

line : 14.4

POLYGON : 14.6

ray : 14.3

segment : 14.2

reflect(point q)

point : 14.1

reflect(point q, point r)

point : 14.1

reflect(rat_point p)

rat_circle : 14.12

rat_ray : 14.10

rat_segment : 14.9

reflect(rat_point p, rat_point q)

rat_circle : 14.12

rat_line : 14.11

rat_point : 14.8

rat_ray : 14.10

rat_segment : 14.9

reflect(rat_point q)

rat_point : 14.8

reflect_point(d3_point q)

d3_plane : 16.5

reflect_point(d3_rat_point q)

d3_rat_plane : 16.12

reflection(POINT q) : 14.14

reflection(POINT q, POINT r) : 14.14

reg_n_gon(int n, CIRCLE C, double epsilon) : 14.6

region_of(POINT p)

GEN_POLYGON : 14.7

POLYGON : 14.6

region_of_sphere(d3_point a, d3_point b, d3_point c, d3_point d, d3_point x) : 16.1

region_of_sphere(d3_rat_point a, d3_rat_point b, d3_rat_point c, d3_rat_point d, d3_rat_point x) : 16.8

rel_freq_of_visit(node v)

dynamic_markov_chain : 11.24

markov_chain : 11.23

relative_neighborhood_graph()

POINT_SET : 15.2

remove(E x)

list<E> : 8.7

remove_bends()

GraphWin : 17.6

remove_bends(edge e)

GraphWin : 17.6

replace(int i, int j, string s1)

string : 6.1

replace(int i, string s1)

string : 6.1

replace(string s1, string s2, int i=1)

string : 6.1

replace_all(string s1, string s2)

string : 6.1

reset()

AdjIt : 13.7

EdgeIt : 13.3

FaceIt : 13.4

GraphWin : 17.6

InAdjIt : 13.6

NodeIt : 13.2

OutAdjIt : 13.5

reset_actions()

GeoWin : 17.7

GraphWin : 17.6

reset_acyclic()

GIT_TOPOSORT<OutAdjI...> : 13.19

reset_clipping()

window : 17.2

reset_defaults()

GraphWin : 17.6

reset_edge_anchors()

GraphWin : 17.6

reset_edges(long mask=E_ALL)

GraphWin : 17.6

reset_end()

AdjIt : 13.7

EdgeIt : 13.3

FaceIt : 13.4

InAdjIt : 13.6

NodeIt : 13.2

OutAdjIt : 13.5

reset_frame_label()

window : 17.2

reset_nodes(long mask=N_ALL)

GraphWin : 17.6

reset_path()

gml_graph : 11.25

resize(int a, int b)

array<E> : 8.1

resize(int n)

array<E> : 8.1

restore_all_attributes()

GraphWin : 17.6

restore_all_edges()

graph : 11.1

restore_all_nodes()

graph : 11.1

restore_edge(edge e)

graph : 11.1

restore_edge_attributes()

GraphWin : 17.6

restore_node(node v)

graph : 11.1

restore_node_attributes()

GraphWin : 17.6

rev_all_edges()

graph : 11.1

rev_edge(edge e)

graph : 11.1

reversal()

rat_segment : 14.9

reversal(edge e)

graph : 11.1

reverse()

circle : 14.5

d3_line : 16.4

d3_rat_line : 16.10

d3_rat_ray : 16.9

d3_rat_segment : 16.11

d3_ray : 16.2

d3_segment : 16.3

line : 14.4

list<E> : 8.7

rat_circle : 14.12

rat_line : 14.11

rat_ray : 14.10

rat_segment : 14.9

ray : 14.3

segment : 14.2

reverse(edge e)

graph : 11.1

reverse(list_item it1, list_item it2)

list<E> : 8.7

reverse_items()

list<E> : 8.7

reverse_items(list_item it1, list_item it2)

list<E> : 8.7

reverse_items(seq_item a, seq_item b)

sortseq<K,I> : 9.3

right(is_item it)

interval_set<I> : 15.3

right_tangent(point p)

circle : 14.5

right_turn(point a, point b, point c) : 14.1

right_turn(rat_point a, rat_point b, rat_point c) : 14.8

root(real x, int d) : 7.4

root(vertex v)

dynamic_trees : 8.14

rotate(double a)

circle : 14.5

line : 14.4

point : 14.1

ray : 14.3

vector : 7.6

rotate(double alpha)

GEN_POLYGON : 14.7

POLYGON : 14.6

segment : 14.2

rotate(point p, double alpha)

GEN_POLYGON : 14.7

POLYGON : 14.6

rotate(point q, double a)

circle : 14.5

line : 14.4

point : 14.1

ray : 14.3

segment : 14.2

rotate90()

point : 14.1

rat_point : 14.8

rat_segment : 14.9

rat_vector : 7.10

segment : 14.2

vector : 7.6

rotate90(point q)

circle : 14.5

GEN_POLYGON : 14.7

line : 14.4

point : 14.1

POLYGON : 14.6

ray : 14.3

segment : 14.2

rotate90(rat_point q)

rat_circle : 14.12

rat_line : 14.11

rat_point : 14.8

rat_ray : 14.10

rat_segment : 14.9

rotation(POINT q, double alpha, double eps) : 14.14

rotation90(POINT q) : 14.14

round(rational q) : 7.2

row(int i)

integer_matrix : 7.9

matrix : 7.7

same_block(node v, node w)

node_partition : 11.18

same_block(partition_item p, partition_item q)

partition : 8.12

Partition<E> : 8.13

save_all_attributes()

GraphWin : 17.6

save_defaults(string fname)

GraphWin : 17.6

save_edge_attributes()

GraphWin : 17.6

save_gml(ostream& out)

GraphWin : 17.6

save_gml(string fname, bool ask_override=false)

GraphWin : 17.6

save_gw(ostream& out)

GraphWin : 17.6

save_gw(string fname, bool ask_override=false)

GraphWin : 17.6

save_latex(string fname, bool ask_override=false)

GraphWin : 17.6

save_layout(ostream& ostr)

GraphWin : 17.6

save_layout(string fname, bool ask_override=false)

GraphWin : 17.6

save_node_attributes()

GraphWin : 17.6

save_ps(string fname, bool ask_override=false)

GraphWin : 17.6

scale()

window : 17.2

search(E x)

list<E> : 8.7

second()

four_tuple<A,B,C,D> : 6.18

three_tuple<A,B,C> : 6.17

two_tuple<A,B> : 6.16

seg()

d3_line : 16.4

d3_rat_line : 16.10

d3_rat_ray : 16.9

d3_ray : 16.2

line : 14.4

rat_line : 14.11

seg(edge e)

POINT_SET : 15.2

segment : 14.2

SEGMENT_INTERSECTION(list<segment> S, GRAPH<point,segment>& G, bool embed=false) : 14.13

SEGMENT_INTERSECTION(list<segment> S, list<point>& P) : 14.13

SEGMENT_INTERSECTION(list<segment> S, void (*report)(segment, segment )) : 14.13

segment_set<I> : 15.4

segments()

POLYGON : 14.6

select(edge e)

GraphWin : 17.6

select(node v)

GraphWin : 17.6

select_all_edges()

GraphWin : 17.6

select_all_nodes()

GraphWin : 17.6

separator()

menu : 17.4

set(int x, E e)

array<E> : 8.1

set(node_array_da<T>& da, Iter it, T val) : 13.13

set(node_attribute_da<T>& ma, Iter it, T val) : 13.16

set(node_member_da<Str,T>& ma, Iter it, T val) : 13.15

set<E> : 8.9

set_action(long mask, geo_action f=0)

GeoWin : 17.7

set_action(long mask, gw_action func)

GraphWin : 17.6

set_active_line_width(geo_scene sc, int w)

GeoWin : 17.7

set_active_line_width(geo_scenegroup gs, int w)

GeoWin : 17.7

set_all_visible(bool v)

GeoWin : 17.7

set_animation_steps(int s)

GraphWin : 17.6

set_bg_color(color c)

GeoWin : 17.7

GraphWin : 17.6

window : 17.2

set_bg_pixmap(char* pr)

window : 17.2

set_bg_pixmap(char* pr, double xorig=0, double yorig=0)

GraphWin : 17.6

set_bg_pixmap(string pix_name)

GeoWin : 17.7

set_bg_redraw(void (*f)(window*, double, double, double, double))

GraphWin : 17.6

set_bg_redraw(void (*F)(window*, double, double, double, double)=0)

window : 17.2

set_bg_xpm(const char** xpm_data)

GraphWin : 17.6

set_bitmap(geo_scene sc, unsigned char* bitmap)

GeoWin : 17.7

set_bitmap_colors(int c0, int c1)

window : 17.2

set_blue(int b)

color : 17.1

set_button_height(int h)

GeoWin : 17.7

set_button_label(int but, string s)

window : 17.2

set_button_pixrects(int but, char *pr1, char* pr2)

window : 17.2

set_button_space(int s)

window : 17.2

set_button_width(int w)

GeoWin : 17.7

set_client_data(void* p, int i=0)

window : 17.2

set_clip_ellipse(double x0, double y0, double r1, double r2)

window : 17.2

set_clip_rectangle(double x0, double y0, double x1, double y1)

window : 17.2

set_color(color c)

window : 17.2

set_color(geo_scene sc, color c)

GeoWin : 17.7

set_color(geo_scenegroup gs, color c)

GeoWin : 17.7

set_cursor(int cursor_id = -1)

GeoWin : 17.7

window : 17.2

set_cyclic_colors(geo_scene sc, bool b)

GeoWin : 17.7

set_d3_fcn(geo_scene sc, void (*f)(geo_scene gs, d3_window& W, GRAPH<d3_point,int>& H))

GeoWin : 17.7

set_date(const string date_str, bool swallow = true)

date : 6.19

set_date(int d, month m, int y)

date : 6.19

set_day(int d)

date : 6.19

set_default_menu(long mask)

GraphWin : 17.6

set_del_edge_handler(bool (*f)(GraphWin& , edge))

GraphWin : 17.6

set_del_edge_handler(void (*f)(GraphWin& )=NULL)

GraphWin : 17.6

set_del_node_handler(bool (*f)(GraphWin& , node))

GraphWin : 17.6

set_del_node_handler(void (*f)(GraphWin& )=NULL)

GraphWin : 17.6

set_directory(string new_dir) : 6.14

set_done_handler(bool (*f)(GeoWin gw))

GeoWin : 17.7

set_dow_names(const char* names[])

date : 6.19

set_edge_bound(int m)

graph : 11.1

set_edge_distance(int d)

GraphWin : 17.6

set_edge_index_format(string s)

GraphWin : 17.6

set_edge_label_font(gw_font_type t, int sz)

GraphWin : 17.6

set_edge_label_font(string fn)

GraphWin : 17.6

set_edge_param(param_type x, bool apply=true)

GraphWin : 17.6

set_edge_position(edge e, edge p)

graph : 11.1

set_edge_slider_handler(void (*f)(GraphWin& , edge, double)=NULL, int sl=0)

GraphWin : 17.6

set_end_edge_slider_handler(void (*f)(GraphWin& , edge, double)=NULL, int sl=0)

GraphWin : 17.6

set_end_move_node_handler(void (*f)(GraphWin& , node))

GraphWin : 17.6

set_error_handler(void (*err_handler)(int, const char*)) : 6.13

set_fill_color(color c)

window : 17.2

set_fill_color(geo_scene sc, color c)

GeoWin : 17.7

set_fill_color(geo_scenegroup gs, color c)

GeoWin : 17.7

set_flush(bool b)

GraphWin : 17.6

window : 17.2

set_frame_label(const char* label)

GeoWin : 17.7

GraphWin : 17.6

set_frame_label(string s)

window : 17.2

set_function(int but, void (*F)(int))

window : 17.2

set_gen_edges(int m)

GraphWin : 17.6

set_gen_nodes(int n)

GraphWin : 17.6

set_graph(graph& G)

GraphWin : 17.6

set_green(int g)

color : 17.1

set_grid_dist(double d)

window : 17.2

set_grid_dist(double g)

GeoWin : 17.7

set_grid_dist(int d)

GraphWin : 17.6

set_grid_mode(int d)

window : 17.2

set_grid_size(int n)

GraphWin : 17.6

set_grid_style(grid_style g)

GeoWin : 17.7

set_grid_style(grid_style s)

GraphWin : 17.6

window : 17.2

set_icon_label(string s)

window : 17.2

set_icon_pixrect(char* pr)

window : 17.2

set_init_graph_handler(bool (*f)(GraphWin& ))

GraphWin : 17.6

set_init_graph_handler(void (*f)(GraphWin& )=NULL)

GraphWin : 17.6

set_input_format(format f)

date : 6.19

set_input_format(string f)

date : 6.19

set_item_height(int h)

window : 17.2

set_item_width(int w)

window : 17.2

set_label(geo_scene sc, string label)

GeoWin : 17.7

set_language(language l)

date : 6.19

set_layout()

GraphWin : 17.6

set_layout(node_array<double> x, node_array<double> y)

GraphWin : 17.6

set_layout(node_array<point> pos)

GraphWin : 17.6

set_layout(node_array<point> pos, edge_array<list<point> > bends, bool reset_anchors=true)

GraphWin : 17.6

set_layout(node_array<point> pos, node_array<double> r1, node_array<double> r2, edge_array<list<point> > bends, edge_array<point> sanch, edge_array<point> tanch)

GraphWin : 17.6

set_line_style(geo_scene sc, line_style l)

GeoWin : 17.7

set_line_style(geo_scenegroup gs, line_style l)

GeoWin : 17.7

set_line_style(line_style s)

window : 17.2

set_line_width(geo_scene sc, int w)

GeoWin : 17.7

set_line_width(geo_scenegroup gs, int w)

GeoWin : 17.7

set_line_width(int pix)

window : 17.2

set_menu(panel_item it, list<string> L, int sz=0)

window : 17.2

set_mode(drawing_mode m)

window : 17.2

set_month(month m)

date : 6.19

set_month_names(const char* names[])

date : 6.19

set_move_node_handler(void (*f)(GraphWin& , node)=NULL)

GraphWin : 17.6

set_name(geo_scene sc, string nm)

GeoWin : 17.7

set_new_edge_handler(bool (*f)(GraphWin& , node, node))

GraphWin : 17.6

set_new_edge_handler(void (*f)(GraphWin& , edge)=NULL)

GraphWin : 17.6

set_new_node_handler(bool (*f)(GraphWin& , point ))

GraphWin : 17.6

set_new_node_handler(void (*f)(GraphWin& , node)=NULL)

GraphWin : 17.6

set_node_bound(int n)

graph : 11.1

set_node_index_format(string s)

GraphWin : 17.6

set_node_label_font(gw_font_type t, int sz)

GraphWin : 17.6

set_node_label_font(string fn)

GraphWin : 17.6

set_node_param(param_type x, bool apply=true)

GraphWin : 17.6

set_node_position(node v, node p)

graph : 11.1

set_node_width(int pix)

window : 17.2

set_output_format(format f)

date : 6.19

set_output_format(string f)

date : 6.19

set_output_mode(output_modes o_mode)

bigfloat : 7.3

set_panel_bg_color(color c)

window : 17.2

set_param(edge e, param_type x)

GraphWin : 17.6

set_param(list<edge>& L, param_type x)

GraphWin : 17.6

set_param(list<node>& L, param_type x)

GraphWin : 17.6

set_param(node v, param_type x)

GraphWin : 17.6

set_pin_point(point p)

GeoWin : 17.7

set_point_style(geo_scene sc, point_style p)

GeoWin : 17.7

set_point_style(geo_scenegroup gs, point_style p)

GeoWin : 17.7

set_position(node_array<double> x, node_array<double> y)

GraphWin : 17.6

set_position(node_array<point> pos)

GraphWin : 17.6

set_precision(int p)

random_source : 6.8

set_precision(int prec)

window : 17.2

set_precision(long p)

bigfloat : 7.3

set_quit_handler(bool (*f)(GeoWin gw))

GeoWin : 17.7

set_range(int low, int high)

random_source : 6.8

set_red(int r)

color : 17.1

set_redraw(void (*F)(window*))

window : 17.2

set_redraw(void (*F)(window*, double, double, double, double)=0)

window : 17.2

set_reversal(edge e, edge r)

graph : 11.1

set_rgb(int r, int g, int b)

color : 17.1

set_rounding_mode(rounding_modes m)

bigfloat : 7.3

set_seed(int s)

random_source : 6.8

set_selection_color(geo_scene sc, color c)

GeoWin : 17.7

set_selection_color(geo_scenegroup gs, color c)

GeoWin : 17.7

set_show_coord_handler(void (*F)(window*, double, double))

window : 17.2

set_show_coordinates(bool b)

window : 17.2

set_show_grid(bool sh)

GeoWin : 17.7

set_show_position(bool sp)

GeoWin : 17.7

set_show_status(bool b)

GraphWin : 17.6

set_start_edge_slider_handler(void (*f)(GraphWin& , edge, double)=NULL, int sl=0)

GraphWin : 17.6

set_start_move_node_handler(bool (*f)(GraphWin& , node)=NULL)

GraphWin : 17.6

set_state(int stat)

window : 17.2

set_text(panel_item it, string s)

window : 17.2

set_text_color(geo_scene sc, color c)

GeoWin : 17.7

set_text_color(geo_scenegroup gs, color c)

GeoWin : 17.7

set_text_mode(text_mode m)

window : 17.2

set_to_current_date()

date : 6.19

set_visible(geo_scene sc, bool v)

GeoWin : 17.7

set_visible(geo_scenegroup gs, bool v)

GeoWin : 17.7

set_weight(edge e, int g)

dynamic_markov_chain : 11.24

set_weight(int i, int g)

dynamic_random_variate : 6.10

set_window(int but, window* M)

window : 17.2

set_window(window& W)

GraphWin : 17.6

set_window_delete_handler(void (*F)(window*))

window : 17.2

set_year(int y)

date : 6.19

set_zoom_factor(double f)

GraphWin : 17.6

set_zoom_labels(bool b)

GraphWin : 17.6

set_zoom_objects(bool b)

GraphWin : 17.6

shift_key_down()

window : 17.2

shortest_path : 12.2

side_of(d3_point q)

d3_plane : 16.5

side_of(d3_rat_point q)

d3_rat_plane : 16.12

side_of(point p)

circle : 14.5

GEN_POLYGON : 14.7

POLYGON : 14.6

side_of(rat_point p)

rat_circle : 14.12

rat_line : 14.11

side_of_circle(point a, point b, point c, point d) : 14.1

side_of_circle(rat_point a, rat_point b, rat_point c, rat_point d) : 14.8

side_of_halfspace(point a, point b, point c) : 14.1

side_of_halfspace(rat_point a, rat_point b, rat_point c) : 14.8

side_of_sphere(d3_point a, d3_point b, d3_point c, d3_point d, d3_point x) : 16.1

side_of_sphere(d3_rat_point a, d3_rat_point b, d3_rat_point c, d3_rat_point d, d3_rat_point e) : 16.8

sign(bigfloat x) : 7.3

Sign(floatf f) : 7.5

sign(integer a) : 7.1

sign(integer q)

real : 7.4

sign(rational q) : 7.2

sign(real x) : 7.4

sign_of_determinant(integer_matrix M) : 7.9

simple_parts()

POLYGON : 14.6

simplify()

TRANSFORM : 14.14

simplify(integer a)

rational : 7.2

size()

array<E> : 8.1

b_queue<E> : 8.6

b_stack<E> : 8.5

d2_dictionary<K1,K2,I> : 15.1

d_array<I,E> : 9.5

d_int_set : 8.11

dictionary<K,I> : 9.1

edge_set : 11.16

GEN_POLYGON : 14.7

h_array<I,E> : 9.7

interval_set<I> : 15.3

list<E> : 8.7

node_pq<P> : 11.19

node_set : 11.15

p_dictionary<K,I> : 9.10

p_queue<P,I> : 10.1

POLYGON : 14.6

pp_dictionary<K,I,CMP> : 9.11

queue<E> : 8.4

segment_set<I> : 15.4

set<E> : 8.9

slist<E> : 8.8

sortseq<K,I> : 9.3

stack<E> : 8.3

size(face f)

graph : 11.1

size(node v)

node_partition : 11.18

size(partition_item p)

partition : 8.12

Partition<E> : 8.13

size_of_file(string fname) : 6.14

slist<E> : 8.8

slope()

line : 14.4

ray : 14.3

segment : 14.2

small_rational_between(rational p, rational q) : 7.2

small_rational_near(rational p, rational eps) : 7.2

SMALLEST_ENCLOSING_CIRCLE(list<point> L) : 14.13

solve(vector b)

matrix : 7.7

sort()

array<E> : 8.1

list<E> : 8.7

sort(int (*cmp)(E, E ))

array<E> : 8.1

sort(int (*cmp)(E, E ), int dd=1)

list<E> : 8.7

sort(int (*cmp)(E, E ), int l, int h)

array<E> : 8.1

sort(int l, int h)

array<E> : 8.1

sort_edges()

GRAPH<vtype,e...> : 11.2

sort_edges(edge_array<T> A)

graph : 11.1

SORT_EDGES(graph& G, edge_array<int> dx, edge_array<int> dy) : 12.11

SORT_EDGES(graph& G, node_array<int> x, node_array<int> y) : 12.11

sort_edges(int (*cmp)(edge, edge ))

graph : 11.1

sort_edges(list<edge> el)

GRAPH<vtype,e...> : 11.2

sort_nodes()

GRAPH<vtype,e...> : 11.2

sort_nodes(int (*cmp)(node, node ))

graph : 11.1

sort_nodes(list<node> vl)

GRAPH<vtype,e...> : 11.2

sort_nodes(node_array<T> A)

graph : 11.1

sortseq<K,I> : 9.3

source()

d3_rat_ray : 16.9

d3_rat_segment : 16.11

d3_ray : 16.2

d3_segment : 16.3

rat_ray : 14.10

ray : 14.3

source(edge e) : 11.1

graph : 11.1

SP_EMBEDDING(graph& G, node_array<double>& x_coord, node_array<double>& y_coord, node_array<double>& x_radius, node_array<double>& y_radius, edge_array<list<double> >& x_bends, edge_array<list<double> >& y_bends, edge_array<double>& x_sanch, edge_array<double>& y_sanch, edge_array<double>& x_tanch, edge_array<double>& y_tanch) : 12.12

SPANNING_TREE(graph G) : 12.10

split(list<node> L)

node_partition : 11.18

split(list<partition_item> L)

partition : 8.12

Partition<E> : 8.13

split(list_item it, list<E>& L1, list<E>& L2)

list<E> : 8.7

split(list_item it, list<E>& L1, list<E>& L2, int dir)

list<E> : 8.7

split(seq_item it, sortseq<K,I>& S1, sortseq<K,I>& S2, int dir=LEDA::after)

sortseq<K,I> : 9.3

split_edge(edge e)

planar_map : 11.5

split_edge(edge e, edge& e1, edge& e2)

graph : 11.1

split_edge(edge e, vtype x)

PLANAR_MAP<vtype,e...> : 11.6

split_face(edge e1, edge e2)

graph : 11.1

split_map_edge(edge e)

graph : 11.1

SPRING_EMBEDDING(graph G, list<node> fixed, node_array<double>& xpos, node_array<double>& ypos, double xleft, double xright, double ybottom, double ytop, int iterations=250) : 12.12

SPRING_EMBEDDING(graph G, node_array<double>& xpos, node_array<double>& ypos, double xleft, double xright, double ybottom, double ytop, int iterations=250) : 12.12

sqr(integer a) : 7.1

sqr(rational q) : 7.2

sqr(real x) : 7.4

sqr_dist()

rat_segment : 14.9

sqr_dist(d3_point p)

d3_line : 16.4

sqr_dist(d3_point q)

d3_plane : 16.5

d3_point : 16.1

sqr_dist(d3_rat_point p)

d3_rat_line : 16.10

sqr_dist(d3_rat_point q)

d3_rat_plane : 16.12

d3_rat_point : 16.8

sqr_dist(point p)

circle : 14.5

GEN_POLYGON : 14.7

POLYGON : 14.6

segment : 14.2

sqr_dist(point q)

line : 14.4

point : 14.1

sqr_dist(rat_point p)

rat_segment : 14.9

sqr_dist(rat_point q)

rat_line : 14.11

rat_point : 14.8

sqr_length()

d3_rat_segment : 16.11

d3_segment : 16.3

rat_segment : 14.9

rat_vector : 7.10

segment : 14.2

vector : 7.6

sqr_radius()

circle : 14.5

d3_rat_sphere : 16.13

d3_sphere : 16.6

rat_circle : 14.12

sqrt(integer a) : 7.1

sqrt(real x) : 7.4

sqrt_d(bigfloat x, long p, int d= 2) : 7.3

ST_NUMBERING(graph G, node_array<int>& stnum, list<node>& stlist, edge e_st = nil) : 12.11

stack<E> : 8.3

start()

rat_segment : 14.9

segment : 14.2

start_buffering()

window : 17.2

start_timer(int msec, void (*F)(window*))

window : 17.2

state()

GIT_SCC<Out,In,...> : 13.20

step(int T = 1)

dynamic_markov_chain : 11.24

markov_chain : 11.23

STL : see iteration | 5.3

STLNodeIt<DataAcc...> : 13.12

stop_buffering()

window : 17.2

stop_buffering(char*& prect)

window : 17.2

stop_timer()

window : 17.2

str()

string_ostream : 6.5

STRAIGHT_LINE_EMBED_MAP(graph& G, node_array<int>& xcoord, node_array<int>& ycoord) : 12.12

STRAIGHT_LINE_EMBEDDING(graph& G, node_array<int>& xc, node_array<int>& yc) : 12.12

string : 6.1

string_istream : 6.4

string_item(string s, string& x, const char* hlp=0)

window : 17.2

string_item(string s, string& x, list<string> L, const char* hlp=0)

window : 17.2

string_item(string s, string& x, list<string> L, int sz, const char* hlp=0)

window : 17.2

string_item(string s, string& x, list<string> L, int sz, void (*F)(char*), const char* hlp=0)

window : 17.2

string_item(string s, string& x, list<string> L, void (*F)(char*), const char* hlp=0)

window : 17.2

string_item(string s, string& x, void (*F)(char*), const char* hlp=0)

window : 17.2

string_ostream : 6.5

STRONG_COMPONENTS(graph G, node_array<int>& compnum) : 12.1

subdivision<I> : 15.5

succ(K k)

sortseq<K,I> : 9.3

succ(list_item it)

list<E> : 8.7

succ(node v)

node_list : 11.17

succ(seq_item it)

sortseq<K,I> : 9.3

succ(slist_item it)

slist<E> : 8.8

succ_edge(edge e)

graph : 11.1

succ_face(face f)

graph : 11.1

succ_face_edge(edge e)

graph : 11.1

succ_node(node v)

graph : 11.1

supporting_line(edge e)

POINT_SET : 15.2

surface()

d3_sphere : 16.6

swap(int i, int j)

array<E> : 8.1

swap(list<E>& L1)

list<E> : 8.7

SWEEP_SEGMENTS(list<segment> S, GRAPH<point,segment>& G, bool embed=false, bool use_optimization = true) : 14.13

sym_diff(GEN_POLYGON Q)

GEN_POLYGON : 14.7

symdiff(d_int_set T)

d_int_set : 8.11

symdiff(set<E> T)

set<E> : 8.9

T_matrix()

TRANSFORM : 14.14

tail()

list<E> : 8.7

node_list : 11.17

slist<E> : 8.8

tail(int i)

string : 6.1

target()

d3_rat_segment : 16.11

d3_segment : 16.3

target(edge e) : 11.1

graph : 11.1

test_bigraph(graph& G, list<node>& A, list<node>& B) : 11.21

test_graph(graph& G) : 11.21

TEXINPUTS : 4.7

text_box(double x0, double x1, double y, string s, bool draw=true)

window : 17.2

text_box(string s)

window : 17.2

text_item(string s)

window : 17.2

third()

four_tuple<A,B,C,D> : 6.18

three_tuple<A,B,C> : 6.17

three_tuple<A,B,C> : 6.17

tmp_file_name() : 6.14

to_bigfloat(real) : 7.4

to_d3_simplex()

d3_rat_simplex : 16.14

to_double() : 7.2

integer : 7.1

to_double(bigfloat x) : 7.3

to_double(integer a) : 7.1

to_double(real) : 7.4

to_float()

d3_rat_line : 16.10

d3_rat_plane : 16.12

d3_rat_point : 16.8

d3_rat_segment : 16.11

d3_rat_sphere : 16.13

GEN_POLYGON : 14.7

integer : 7.1

POLYGON : 14.6

rat_circle : 14.12

rat_line : 14.11

rat_point : 14.8

rat_ray : 14.10

rat_segment : 14.9

rat_vector : 7.10

rational : 7.2

to_integer(bigfloat x, rounding_modes rmode= TO_NEAREST) : 7.3

to_long()

integer : 7.1

to_string() : 7.3

integer : 7.1

rational : 7.2

to_vector()

d3_line : 16.4

d3_point : 16.1

d3_rat_line : 16.10

d3_rat_point : 16.8

d3_rat_ray : 16.9

d3_rat_segment : 16.11

d3_ray : 16.2

d3_segment : 16.3

point : 14.1

rat_point : 14.8

rat_segment : 14.9

segment : 14.2

top()

b_queue<E> : 8.6

b_stack<E> : 8.5

queue<E> : 8.4

stack<E> : 8.3

TOPSORT(graph G, node_array<int>& ord) : 12.1

trans()

matrix : 7.7

TRANSFORM : 14.14

TRANSITIVE_CLOSURE(graph G) : 12.1

translate(double dx, double dy)

circle : 14.5

line : 14.4

point : 14.1

ray : 14.3

segment : 14.2

translate(double dx, double dy, double dz)

d3_line : 16.4

d3_plane : 16.5

d3_point : 16.1

d3_ray : 16.2

d3_segment : 16.3

d3_simplex : 16.7

d3_sphere : 16.6

translate(INT_TYPE dx, INT_TYPE dy, INT_TYPE dw)

GEN_POLYGON : 14.7

POLYGON : 14.6

translate(integer dx, integer dy, integer dw)

rat_circle : 14.12

rat_line : 14.11

rat_point : 14.8

rat_ray : 14.10

rat_segment : 14.9

translate(integer dx, integer dy, integer dz, integer dw)

d3_rat_line : 16.10

d3_rat_plane : 16.12

d3_rat_point : 16.8

d3_rat_segment : 16.11

d3_rat_simplex : 16.14

translate(RAT_TYPE dx, RAT_TYPE dy)

GEN_POLYGON : 14.7

POLYGON : 14.6

translate(rat_vector v)

d3_rat_line : 16.10

d3_rat_plane : 16.12

d3_rat_point : 16.8

d3_rat_ray : 16.9

d3_rat_segment : 16.11

d3_rat_simplex : 16.14

d3_rat_sphere : 16.13

rat_circle : 14.12

rat_line : 14.11

rat_point : 14.8

rat_ray : 14.10

rat_segment : 14.9

translate(rational dx, rational dy)

rat_circle : 14.12

rat_line : 14.11

rat_point : 14.8

rat_ray : 14.10

rat_segment : 14.9

translate(rational dx, rational dy, rational dz)

d3_rat_plane : 16.12

d3_rat_point : 16.8

d3_rat_ray : 16.9

d3_rat_segment : 16.11

d3_rat_simplex : 16.14

translate(rational r1, rational r2, rational r3)

d3_rat_sphere : 16.13

translate(vector v)

circle : 14.5

d3_line : 16.4

d3_plane : 16.5

d3_point : 16.1

d3_ray : 16.2

d3_segment : 16.3

d3_simplex : 16.7

d3_sphere : 16.6

GEN_POLYGON : 14.7

line : 14.4

point : 14.1

POLYGON : 14.6

ray : 14.3

segment : 14.2

translate_by_angle(double a, double d)

circle : 14.5

line : 14.4

ray : 14.3

translate_by_angle(double alpha, double d)

GEN_POLYGON : 14.7

point : 14.1

POLYGON : 14.6

segment : 14.2

translation(INT_TYPE dx, INT_TYPE dy, INT_TYPE dw) : 14.14

translation(RAT_TYPE dx, RAT_TYPE dy) : 14.14

translation(VECTOR v) : 14.14

transpose(integer_matrix M) : 7.9

Tree

a-b : 18.1.1

AVL : 18.1.1

BB[$\alpha$] : 18.1.1

persistent : 18.1.1

randomized search : 18.1.1

red-black : 18.1.1

skiplists : 18.1.1

tree_collection<I> : 8.15

triangulate()

planar_map : 11.5

triangulate_map()

graph : 11.1

triangulate_planar_map()

graph : 11.1

TRIANGULATE_PLANAR_MAP(graph& G) : 12.11

TRIANGULATE_PLANE_MAP(GRAPH<point,segment>& G) : 14.13

TRIANGULATE_POINTS(list<point> L, GRAPH<point,int>& T) : 14.13

TRIANGULATE_POLYGON(gen_polygon GP, GRAPH<point,segment>& G, list<edge>& inner_edges, list<edge>& outer_edges, list<edge>& boundary_edges, list<edge>& hole_edges) : 14.13

TRIANGULATE_POLYGON(polygon P, GRAPH<point,segment>& G, list<edge>& inner_edges, list<edge>& outer_edges, list<edge>& boundary_edges) : 14.13

TRIANGULATE_SEGMENTS(list<segment> L, GRAPH<point,segment>& G) : 14.13

triangulated_planar_graph(graph& G, int n) : 11.21

triangulated_planar_graph(graph& G, list<node>& outer_face, node_array<double>& xcoord, node_array<double>& ycoord, int n) : 11.21

triangulated_planar_graph(graph& G, node_array<double>& xcoord, node_array<double>& ycoord, int n) : 11.21

triangulation_graph(graph& G, int n) : 11.21

triangulation_graph(graph& G, list<node>& outer_face, node_array<double>& xcoord, node_array<double>& ycoord, int n) : 11.21

triangulation_graph(graph& G, node_array<double>& xcoord, node_array<double>& ycoord, int n) : 11.21

triangulation_map(graph& G, int n) : 11.21

triangulation_map(graph& G, list<node>& outer_face, node_array<double>& xcoord, node_array<double>& ycoord, int n) : 11.21

triangulation_map(graph& G, node_array<double>& xcoord, node_array<double>& ycoord, int n) : 11.21

trivial()

GEN_POLYGON : 14.7

trunc(rational q) : 7.2

truncate(double x, int k = 10) : 6.15

TUTTE_EMBEDDING(graph G, list<node> fixed_nodes, node_array<double>& xpos, node_array<double>& ypos) : 12.12

two_tuple<A,B> : 6.16

ugraph : 11.3

UGRAPH<vtype,e...> : 11.4

undefine(I i)

d_array<I,E> : 9.5

h_array<I,E> : 9.7

undo_clear()

GraphWin : 17.6

union_blocks(node v, node w)

node_partition : 11.18

union_blocks(partition_item p, partition_item q)

partition : 8.12

Partition<E> : 8.13

unique()

list<E> : 8.7

unique(int (*cmp)(E, E ))

list<E> : 8.7

unit(int i, int d=2)

rat_vector : 7.10

unite(GEN_POLYGON Q)

GEN_POLYGON : 14.7

unsaved_changes()

GraphWin : 17.6

unzoom()

GraphWin : 17.6

update(leda_edge e)

AdjIt : 13.7

EdgeIt : 13.3

FaceCirc : 13.8

InAdjIt : 13.6

OutAdjIt : 13.5

update(leda_face n)

FaceIt : 13.4

update(leda_node n)

AdjIt : 13.7

InAdjIt : 13.6

NodeIt : 13.2

OutAdjIt : 13.5

update(leda_node n, leda_edge e)

AdjIt : 13.7

InAdjIt : 13.6

OutAdjIt : 13.5

update(vertex v, double x)

dynamic_trees : 8.14

update_graph()

GraphWin : 17.6

UPPER_CONVEX_HULL(list<point> L) : 14.13

use_edge_data(graph G, E x)

edge_array<E> : 11.8

edge_map<E> : 11.11

use_face_data(graph G, E x)

face_array<E> : 11.9

use_node_data(graph G, E x)

node_array<E> : 11.7

node_map<E> : 11.10

used_time() : 6.15

used_time(float& T) : 6.15

used_words()

integer : 7.1

User defined parameter types

compare(...) : 4.3

copy constructor : 4.3

default constructor : 4.3

Hash(...) : 4.3

operator>> : 4.3

operator<< : 4.3

valid()

AdjIt : 13.7

EdgeIt : 13.3

FaceCirc : 13.8

FaceIt : 13.4

InAdjIt : 13.6

NodeIt : 13.2

OutAdjIt : 13.5

value_type

array<E> : 8.1

list<E> : 8.7

vector : 7.6

verify_determinant(integer_matrix M, integer D, integer_matrix& L, integer_matrix& U, array<int> q, integer_vector& c) : 7.9

Version Macro : 3

version()

GeoWin : 17.7

vertex_inf(vertex v)

dynamic_trees : 8.14

vertices()

GEN_POLYGON : 14.7

POLYGON : 14.6

VISIBILITY_REPRESENTATION(graph& G, node_array<double>& x_pos, node_array<double>& y_pos, node_array<double>& x_rad, node_array<double>& y_rad, edge_array<double>& x_sanch, edge_array<double>& y_sanch, edge_array<double>& x_tanch, edge_array<double>& y_tanch) : 12.12

vol()

d3_rat_simplex : 16.14

d3_simplex : 16.7

volume()

d3_sphere : 16.6

volume(d3_point a, d3_point b, d3_point c, d3_point d) : 16.1

volume(d3_rat_point a, d3_rat_point b, d3_rat_point c, d3_rat_point d) : 16.8

VORONOI(list<point> L, GRAPH<circle,point>& VD) : 14.13

W()

d3_rat_point : 16.8

rat_point : 14.8

rat_vector : 7.10

W1()

rat_segment : 14.9

W2()

rat_segment : 14.9

wait()

GraphWin : 17.6

wait(const char* msg)

GraphWin : 17.6

wait(float sec, const char* msg=")

GraphWin : 17.6

WD()

d3_rat_point : 16.8

rat_point : 14.8

WD1()

rat_segment : 14.9

WD2()

rat_segment : 14.9

width()

window : 17.2

WIDTH(list<point> L, line& l1, line& l2) : 14.13

win_init(double xmin, double xmax, double ymin)

GraphWin : 17.6

window : 17.2

write(geo_scene sc, ostream& os)

GeoWin : 17.7

write(ostream& O = cout)

graph : 11.1

write(string fname)

GRAPH<vtype,e...> : 11.2

write(string s)

graph : 11.1

write_active_scene(ostream& os)

GeoWin : 17.7

write_gml(ostream& O = cout, void (*node_cb)(ostream& , const graph*, const node)=0, void (*edge_cb)(ostream& , const graph*, const edge)=0)

graph : 11.1

write_gml(string s, void (*node_cb)(ostream& , const graph*, const node)=0, void (*edge_cb)(ostream& , const graph*, const edge)=0)

graph : 11.1

X()

d3_rat_point : 16.8

rat_point : 14.8

rat_vector : 7.10

X1()

rat_segment : 14.9

X2()

rat_segment : 14.9

x_proj(double y)

line : 14.4

segment : 14.2

xcoord()

d3_point : 16.1

d3_rat_point : 16.8

point : 14.1

rat_point : 14.8

rat_vector : 7.10

vector : 7.6

xcoord1()

d3_rat_segment : 16.11

d3_segment : 16.3

rat_segment : 14.9

segment : 14.2

xcoord1D()

rat_segment : 14.9

xcoord2()

d3_rat_segment : 16.11

d3_segment : 16.3

rat_segment : 14.9

segment : 14.2

xcoord2D()

rat_segment : 14.9

xcoordD()

d3_rat_point : 16.8

rat_point : 14.8

XD()

d3_rat_point : 16.8

rat_point : 14.8

XD1()

rat_segment : 14.9

XD2()

rat_segment : 14.9

xdist(d3_point q)

d3_point : 16.1

xdist(d3_rat_point q)

d3_rat_point : 16.8

xdist(point q)

point : 14.1

xdist(rat_point q)

rat_point : 14.8

xmax()

window : 17.2

xmin()

window : 17.2

xpos()

window : 17.2

Y()

d3_rat_point : 16.8

rat_point : 14.8

rat_vector : 7.10

Y1()

rat_segment : 14.9

Y2()

rat_segment : 14.9

y_abs()

line : 14.4

segment : 14.2

y_proj(double x)

line : 14.4

segment : 14.2

ycoord()

d3_point : 16.1

d3_rat_point : 16.8

point : 14.1

rat_point : 14.8

rat_vector : 7.10

vector : 7.6

ycoord1()

d3_rat_segment : 16.11

d3_segment : 16.3

rat_segment : 14.9

segment : 14.2

ycoord1D()

rat_segment : 14.9

ycoord2()

d3_rat_segment : 16.11

d3_segment : 16.3

rat_segment : 14.9

segment : 14.2

ycoord2D()

rat_segment : 14.9

ycoordD()

d3_rat_point : 16.8

rat_point : 14.8

YD()

d3_rat_point : 16.8

rat_point : 14.8

YD1()

rat_segment : 14.9

YD2()

rat_segment : 14.9

ydist(d3_point q)

d3_point : 16.1

ydist(d3_rat_point q)

d3_rat_point : 16.8

ydist(point q)

point : 14.1

ydist(rat_point q)

rat_point : 14.8

years_until(date D2)

date : 6.19

Yes(string s) : 6.15

ymax()

window : 17.2

ymin()

window : 17.2

ypos()

window : 17.2

Z()

d3_rat_point : 16.8

rat_vector : 7.10

zcoord()

d3_point : 16.1

d3_rat_point : 16.8

rat_vector : 7.10

vector : 7.6

zcoord1()

d3_rat_segment : 16.11

d3_segment : 16.3

zcoord2()

d3_rat_segment : 16.11

d3_segment : 16.3

zcoordD()

d3_rat_point : 16.8

ZD()

d3_rat_point : 16.8

zdist(d3_point q)

d3_point : 16.1

zdist(d3_rat_point q)

d3_rat_point : 16.8

zero(int d=2)

rat_vector : 7.10

zero_of_function(double (*f)(double), double l, double r, double tol = 1.0e-10) : 7.11.4

zoom(double f)

GraphWin : 17.6

zoom_area(double x0, double y0, double x1, double y1)

GraphWin : 17.6

zoom_down()

GeoWin : 17.7

zoom_graph()

GraphWin : 17.6

zoom_up()

GeoWin : 17.7