- Page 1:
Version 5.0 The LEDA User Manual Al
- Page 4 and 5:
4.14 Socket Streambuffer ( socket s
- Page 6 and 7:
9.11 Move-To-Front Coder II ( MTF2C
- Page 8 and 9:
13.1.2 Handles and Iterators . . .
- Page 10 and 11:
16.7 Simplices in 3D-Space ( d3 sim
- Page 13:
License Terms and Availability Any
- Page 16 and 17:
7. LEDA is available from Algorithm
- Page 19 and 20:
Chapter 2 Basics An extended versio
- Page 21 and 22:
XYZ y(x1, ... ,xt); ,tk > and uses
- Page 23 and 24:
2.3.1 Linear Orders Many data types
- Page 25 and 26:
dictionary D0; // default ordering
- Page 27 and 28:
2.3.3 Implementation Parameters Man
- Page 29 and 30:
lookup returned the location where
- Page 31:
list::iterator defines the iterator
- Page 34 and 35:
• internal (LEDA/incl/internal/)
- Page 36 and 37:
string s(const char ∗ p); string
- Page 38 and 39:
ool bool bool bool istream& ostream
- Page 40 and 41:
string buffer, i.e., all output ope
- Page 42 and 43:
andom source& S ≫ char& x random
- Page 44 and 45:
int R.set weight(int i, int g) sets
- Page 46 and 47:
4.10 Memory Allocator ( leda alloca
- Page 48 and 49:
4.11 Error Handling ( error ) LEDA
- Page 50 and 51:
4.12 Files and Directories ( file )
- Page 52 and 53:
4.13 Sockets ( leda socket ) 1. Def
- Page 54 and 55:
ool S.receive string(string& s) rec
- Page 56 and 57:
ool sb.failed( ) returns whether a
- Page 58 and 59:
4.15 Some Useful Functions ( misc )
- Page 60 and 61:
4.16 Timer ( timer ) 1. Definition
- Page 62 and 63:
unsigned fibonacci(unsigned n) { st
- Page 64 and 65:
unsigned fibonacci(unsigned n) { st
- Page 66 and 67:
int Hash(const two tuple& p) hash f
- Page 68 and 69:
3. Creation four tuple p; creates a
- Page 70 and 71:
4.21 A date interface ( date ) 1. D
- Page 72 and 73:
3. Creation date D; creates an inst
- Page 74 and 75:
string D.get month name( ) returns
- Page 76 and 77:
Now we show an example in which dif
- Page 78 and 79:
integer integer a(const char ∗ s)
- Page 80 and 81:
5.2 Rational Numbers ( rational ) 1
- Page 82 and 83:
5.3 The data type bigfloat ( bigflo
- Page 84 and 85:
ounding modes bigfloat :: get round
- Page 86 and 87:
ostream& ostream& os ≪ const bigf
- Page 88 and 89:
double x.get double error( ) bigflo
- Page 90 and 91:
int int real roots(const Polynomial
- Page 92 and 93:
√ y v = b 1 c 2 + b 2 c 1 ± sign
- Page 94 and 95:
5.5 Interval Arithmetic in LEDA ( i
- Page 96 and 97:
void x.set midpoint(VOLATILE I doub
- Page 98 and 99:
5.7 The mod kernel of type residual
- Page 100 and 101:
int residual :: required primetable
- Page 102 and 103:
5.9 A Floating Point Filter ( float
- Page 104 and 105:
5.10 Double-Valued Vectors ( vector
- Page 106 and 107:
double v.zcoord( ) returns the seco
- Page 108 and 109:
matrix matrix matrix vector M + con
- Page 110 and 111:
5.12 Vectors with Integer Entries (
- Page 112 and 113:
5.13 Matrices with Integer Entries
- Page 114 and 115:
integer matrix inverse(const intege
- Page 116 and 117:
distinct representatives and linear
- Page 118 and 119:
at vector v(const array& A); introd
- Page 120 and 121:
int compare by angle(const rat vect
- Page 122 and 123:
5.15 Real-Valued Vectors ( real vec
- Page 124 and 125:
int compare by angle(const real vec
- Page 126 and 127:
eal matrix M + const real matrix& M
- Page 128 and 129:
5.17.2 Integration double integrate
- Page 130 and 131:
array A(int low, const E& x, const
- Page 132 and 133:
int A.binary locate(int (∗cmp)(co
- Page 134 and 135:
6.3 Stacks ( stack ) 1. Definition
- Page 136 and 137:
6.5 Bounded Stacks ( b stack ) 1. D
- Page 138 and 139:
6.7 Linear Lists ( list ) 1. Defini
- Page 140 and 141:
const E& L.pop front( ) same as L.p
- Page 142 and 143:
Sorting and Searching void L.sort(i
- Page 144 and 145:
Input and Output void L.read(istrea
- Page 146 and 147:
6.8 Singly Linked Lists ( slist ) 1
- Page 148 and 149:
6.9 Sets ( set ) 1. Definition An i
- Page 150 and 151:
4. Implementation Sets are implemen
- Page 152 and 153:
int set S | const int set& T return
- Page 154 and 155:
d int set S − const d int set& T
- Page 156 and 157:
6.12 Partitions ( partition ) 1. De
- Page 158 and 159:
6.13 Parameterized Partitions ( Par
- Page 160 and 161:
void D.evert(vertex v) makes v the
- Page 162 and 163:
4. Implementation Dynamic collectio
- Page 164 and 165:
dictionary D(int (∗cmp)(const K&
- Page 166 and 167:
7.2 Dictionary Arrays ( d array ) 1
- Page 168 and 169:
{ d_array dic; dic["hello"] = "hall
- Page 170 and 171:
ool A.empty( ) returns true if A is
- Page 172 and 173:
Note that it is not possible to ite
- Page 174 and 175:
void M.clear( ) clears M by making
- Page 176 and 177:
p dictionary D.change inf(p dic ite
- Page 178 and 179:
void D.del(const K& k) deletes the
- Page 180 and 181:
3. Creation sortseq S; creates an i
- Page 182 and 183:
seq item S.max item( ) returns the
- Page 184 and 185:
Iteration forall items(it, S) { “
- Page 187 and 188:
Chapter 8 Priority Queues 8.1 Prior
- Page 189 and 190:
6. Example Dijkstra’s Algorithm (
- Page 191:
int Q.size( ) returns the size of Q
- Page 194 and 195:
Assume that you want to send the fi
- Page 196 and 197:
9.1 Adaptive Arithmetic Coder ( A0C
- Page 198 and 199:
uint32 C.get scale threshold( ) uin
- Page 200 and 201:
uint32 C.decode memory chunk(const
- Page 202 and 203:
3. Creation PPMIICoder C(streambuf
- Page 204 and 205:
9.4 Deflation/Inflation Coder ( Def
- Page 206 and 207:
void C.set compression level(int le
- Page 208 and 209:
void void C.set src stream(streambu
- Page 210 and 211:
streambuf ∗ C.get src stream( ) r
- Page 212 and 213:
streambuf ∗ C.get src stream( ) r
- Page 214 and 215:
uint32 C.decode memory chunk(const
- Page 216 and 217:
uint32 C.encode memory chunk(const
- Page 218 and 219:
9.10 Move-To-Front Coder ( MTFCoder
- Page 220 and 221:
9.11 Move-To-Front Coder II ( MTF2C
- Page 222 and 223:
9.12 RLE for Runs of Zero ( RLE0Cod
- Page 224 and 225:
9.13 Checksummers ( checksummer bas
- Page 226 and 227:
ool C.checksum is valid( ) returns
- Page 228 and 229:
9.19 Encoding Output Stream ( encod
- Page 230 and 231:
ostream& os.seekp(streamoff off , i
- Page 232 and 233:
9.23 Coder Pipes ( CoderPipe2 ) 1.
- Page 234 and 235:
void C.set coder1(Coder1 ∗ c1 , b
- Page 236 and 237:
void void C.set src stream(streambu
- Page 238 and 239:
3. Operations Standard Operations v
- Page 240 and 241:
string out_file1 = tmp_file_name(),
- Page 242 and 243:
void mb.truncate(streamsize n) also
- Page 244 and 245:
e able to change your message witho
- Page 246 and 247:
Then you can use the CryptAutoDecod
- Page 248 and 249:
10.1 Secure Byte String ( CryptByte
- Page 250 and 251:
CryptKey k(const byte ∗ bytes, ui
- Page 252 and 253:
10.3 Encryption and Decryption with
- Page 254 and 255:
10.4 Example for a Stream-Cipher (
- Page 256 and 257:
uint16 void C.get accepted key size
- Page 258 and 259:
3. Operations Standard Operations v
- Page 260 and 261:
10.6 Automatic Decoder supporting C
- Page 262 and 263:
void C.add keys in file(const char
- Page 264 and 265:
secure socket streambuf sb(leda soc
- Page 267 and 268:
Chapter 11 Graphs and Related Data
- Page 269 and 270:
2. Creation graph G; creates an obj
- Page 271 and 272:
edge G.first in edge(node v) return
- Page 273 and 274:
void G.hide node(node v) removes no
- Page 275 and 276:
void G.bucket sort nodes(int l, int
- Page 277 and 278:
edge G.new map edge(edge e1 , edge
- Page 279 and 280:
edge edge edge G.new edge(node v, e
- Page 281 and 282:
void void G.print(string s, ostream
- Page 283 and 284:
graph algorithms, i.e., algorithms
- Page 285 and 286:
void void G.sort nodes(const list&
- Page 287 and 288:
• Opposite Graphs (opposite graph
- Page 289 and 290:
4. Operations The interface consist
- Page 291 and 292:
int main () { static_graph G; array
- Page 293 and 294:
3. Implementation see section 11.2.
- Page 295 and 296:
list M.triangulate( ) triangulates
- Page 297 and 298:
void M.assign(face f, const ftype&
- Page 299 and 300:
void A.init(const graph t& G, int n
- Page 301 and 302:
void A.init(const graph t& G, int n
- Page 303 and 304:
void A.init(const graph t& G, int n
- Page 305 and 306:
ool M.use node data(const graph t&
- Page 307 and 308:
ool M.use edge data(const graph t&
- Page 309 and 310:
E& M[face f] returns the variable M
- Page 311 and 312:
4. Implementation Node matrices for
- Page 313 and 314:
4. Implementation Node maps are imp
- Page 315 and 316:
11.17 Sets of Edges ( edge set ) 1.
- Page 317 and 318:
node L.cyclic pred(node v) returns
- Page 319 and 320:
11.20 Node Priority Queues ( node p
- Page 321 and 322:
11.21 Bounded Node Priority Queues
- Page 323 and 324:
11.22 Graph Generators ( graph gen
- Page 325 and 326:
uedges. For n > 3, a random maximal
- Page 327 and 328:
void random planar graph(graph& G,
- Page 329 and 330:
ool Is Bidirected(const graph& G) r
- Page 331 and 332:
list Delete Loops(graph& G) returns
- Page 333 and 334:
11.25 Dynamic Markov Chains ( dynam
- Page 335 and 336:
has a source and a target. These ar
- Page 337 and 338:
void parser.append(const char ∗ k
- Page 339:
11.27 The LEDA graph input/output f
- Page 342 and 343:
arithmetic demand for each function
- Page 344 and 345:
GRAPH TRANSITIVE CLOSURE(const gra
- Page 346 and 347:
template bool SHORTEST PATH T(cons
- Page 348 and 349:
template bool ALL PAIRS SHORTEST P
- Page 350 and 351:
The algorithms have the following a
- Page 352 and 353:
inline NT MAX FLOW GRH T(const grap
- Page 354 and 355:
12.5 Minimum Cut ( min cut ) A cut
- Page 356 and 357:
that the bipartition (A, B) is give
- Page 358 and 359:
The pre-instantiations for number t
- Page 360 and 361:
template bool CHECK MIN WEIGHT ASS
- Page 362 and 363:
in general graph. You may skip the
- Page 364 and 365:
Worst-Case Running Time: All functi
- Page 366 and 367:
list MIN WEIGHT PERFECT MATCHING T(
- Page 368 and 369:
12.10 Stable Matching ( stable matc
- Page 370 and 371:
12.11 Minimum Spanning Trees ( min
- Page 372 and 373: 12.13 Algorithms for Planar Graphs
- Page 374 and 375: ool bool Is CCW Ordered(const graph
- Page 376 and 377: ool void void void TUTTE EMBEDDING(
- Page 379 and 380: Chapter 13 Graphs and Iterators 13.
- Page 381 and 382: The purpose of each iterator is the
- Page 383 and 384: template void set_and_check (graph
- Page 385 and 386: In addition to the algorithm mentio
- Page 387 and 388: 13.3 Edge Iterators ( EdgeIt ) 1. D
- Page 389 and 390: #include < LEDA/graph/graph iterato
- Page 391 and 392: OutAdjIt OutAdjIt OutAdjIt it(const
- Page 393 and 394: OutAdjIt& −−it performs one ste
- Page 395 and 396: ool it.eol( ) returns !it.valid( )
- Page 397 and 398: void it.del( ) deletes the marked l
- Page 399 and 400: 3. Operations void fc.init(const le
- Page 401 and 402: We would have to write something li
- Page 403 and 404: Equal is a class that compares two
- Page 405 and 406: used only as a “Trojan horse,”
- Page 407 and 408: typename DataAccessor :: value type
- Page 409 and 410: 13.14 Constant Accessors ( constant
- Page 411 and 412: 13.16 Node Attribute Accessors ( no
- Page 413 and 414: GIT BFS< OutAdjIt, Queuetype, Mark
- Page 415 and 416: 3. dfs grow depth: a new adjacency
- Page 417 and 418: • indegree stores for every node
- Page 419 and 420: • Mark is a data accessor that ha
- Page 421: OutAdjIt algorithm.curr adj( ) retu
- Page 425 and 426: double p.sqr dist(const point& q) i
- Page 427 and 428: ool collinear(const point& a, const
- Page 429 and 430: 14.2 Segments ( segment ) 1. Defini
- Page 431 and 432: ool s.contains(const point& p) bool
- Page 433 and 434: 14.3 Straight Rays ( ray ) 1. Defin
- Page 435 and 436: ay r.reflect(const point& p) return
- Page 437 and 438: double l.direction( ) returns the d
- Page 439 and 440: int cmp slopes(const line& l1 , con
- Page 441 and 442: circle C(const circle& c, int); 4.
- Page 443 and 444: double C.distance(const circle& D)
- Page 445 and 446: POLYGON POLYGON P (const list& pl,
- Page 447 and 448: list P.simple parts( ) returns the
- Page 449 and 450: POLYGON n gon(int n, CIRCLE C, doub
- Page 451 and 452: GEN POLYGON P (const POLYGON & p, C
- Page 453 and 454: list P.intersection(const SEGMENT &
- Page 455 and 456: The following functions are only av
- Page 457 and 458: int t.side of(const point& p) regio
- Page 459 and 460: 14.9 Iso-oriented Rectangles ( rect
- Page 461 and 462: ectangle r.rotate90(const point& p,
- Page 463 and 464: at point p(const point& p1 , int pr
- Page 465 and 466: int cmp signed dist(const rat point
- Page 467 and 468: 14.11 Rational Segments ( rat segme
- Page 469 and 470: integer s.W2( ) returns the third h
- Page 471 and 472: at segment s.rotate90(int i = 1) re
- Page 473 and 474:
at point r.source( ) returns the so
- Page 475 and 476:
14.13 Straight Rational Lines ( rat
- Page 477 and 478:
at line l.reflect(const rat point&
- Page 479 and 480:
14.14 Rational Circles ( rat circle
- Page 481 and 482:
at circle C.translate(integer dx, i
- Page 483 and 484:
at point t[int i] returns the i-th
- Page 485 and 486:
14.16 Iso-oriented Rational Rectang
- Page 487 and 488:
at rectangle r.include(const rat re
- Page 489 and 490:
14.17 Real Points ( real point ) 1.
- Page 491 and 492:
eal point p.reflect(const real poin
- Page 493 and 494:
int compare by angle(const real poi
- Page 495 and 496:
4. Operations real point s.start( )
- Page 497 and 498:
eal segment s.reverse( ) returns s
- Page 499 and 500:
eal point r.point2( ) returns a poi
- Page 501 and 502:
14.20 Straight Real Lines ( real li
- Page 503 and 504:
eal line l.translate(const real vec
- Page 505 and 506:
14.21 Real Circles ( real circle )
- Page 507 and 508:
eal circle C + const real vector& v
- Page 509 and 510:
14.22 Real Triangles ( real triangl
- Page 511 and 512:
eal triangle t + const real vector&
- Page 513 and 514:
eal r.xmin( ) returns the minimal x
- Page 515 and 516:
list r.intersection(const real rect
- Page 517 and 518:
double WIDTH(const list& L, line& l
- Page 519 and 520:
edge CONVEX COMPONENTS(const gen po
- Page 521 and 522:
ool Is Delaunay Diagram(const GRAPH
- Page 523 and 524:
void SWEEP SEGMENTS(const list& S,
- Page 525 and 526:
template bool Is CCW Ordered Plane
- Page 527 and 528:
TRANSFORM T (const TRANSFORM & T1 )
- Page 529 and 530:
14.26 Point Generators ( point gene
- Page 531 and 532:
void random points near circle(int
- Page 533 and 534:
14.27 Point on Rational Circle ( r
- Page 535 and 536:
14.28 Segment of Rational Circle (
- Page 537 and 538:
ool cs.contains(const r circle poin
- Page 539 and 540:
void SWEEP SEGMENTS(const list& L,
- Page 541 and 542:
circle polygon P (const list& chain
- Page 543 and 544:
circle polygon P.reflect(const rat
- Page 545 and 546:
14.30 Generalized polygons with cir
- Page 547 and 548:
circle gen polygon P (const rat cir
- Page 549 and 550:
circle polygon P.to r circle polygo
- Page 551 and 552:
Chapter 15 Advanced Data Types for
- Page 553 and 554:
4. Implementation Two-dimensional d
- Page 555 and 556:
POINT SET POINT SET T (const list&
- Page 557 and 558:
node T.lookup(POINT p, const list&
- Page 559 and 560:
void T.draw edge(edge e, void (∗d
- Page 561 and 562:
void S.change inf(is item it, const
- Page 563 and 564:
list S.intersection sorted(const se
- Page 565 and 566:
list S.intersection sorted(const ra
- Page 567 and 568:
Chapter 16 Basic Data Types for Thr
- Page 569 and 570:
double p.ydist(const d3 point& q) r
- Page 571 and 572:
int region of sphere(const d3 point
- Page 573 and 574:
16.2 Straight Rays in 3D-Space ( d3
- Page 575 and 576:
16.3 Segments in 3D-Space ( d3 segm
- Page 577 and 578:
16.4 Straight Lines in 3D-Space ( d
- Page 579 and 580:
16.5 Planes ( d3 plane ) 1. Definit
- Page 581 and 582:
ool p.contains(const d3 point& q) b
- Page 583 and 584:
d3 sphere S.translate(double dx, do
- Page 585 and 586:
ool S.insphere(const d3 point& p) r
- Page 587 and 588:
integer p.W( ) returns the fourth h
- Page 589 and 590:
int orientation(const d3 rat point&
- Page 591 and 592:
ool affinely independent(const list
- Page 593 and 594:
d3 rat point random d3 rat point on
- Page 595 and 596:
16.9 Straight Rational Rays in 3D-S
- Page 597 and 598:
16.10 Rational Lines in 3D-Space (
- Page 599 and 600:
ool l.intersection(const d3 rat lin
- Page 601 and 602:
ational s.dy( ) returns ycoord2 ( )
- Page 603 and 604:
16.12 Rational Planes ( d3 rat plan
- Page 605 and 606:
ool p.contains(const d3 rat point&
- Page 607 and 608:
d3 rat sphere S.translate(const rat
- Page 609 and 610:
ool S.in simplex(const d3 rat point
- Page 611:
16.16 3D Triangulation and Voronoi
- Page 614 and 615:
3. Operations void col.set rgb(int
- Page 616 and 617:
4. Minimal and maximal coordinates
- Page 618 and 619:
All four variants initialize the co
- Page 620 and 621:
line style W.set line style(line st
- Page 622 and 623:
int W.get node width( ) returns the
- Page 624 and 625:
void void void W.draw segment(const
- Page 626 and 627:
void void W.draw bezier arrow(const
- Page 628 and 629:
void W.draw rectangle(double x 0 ,
- Page 630 and 631:
double W.text box(double x 0 , doub
- Page 632 and 633:
int void void void void void void W
- Page 634 and 635:
3.5 Input The main input operation
- Page 636 and 637:
int W.read mouse arc(double x 0 , d
- Page 638 and 639:
int W.read int(string p) displays a
- Page 640 and 641:
in this section add panel items or
- Page 642 and 643:
panel item W.lstyle item(string s,
- Page 644 and 645:
panel item panel item panel item W.
- Page 646 and 647:
int W.button(char ∗ pr1 , char
- Page 648 and 649:
void W.disable button(int b) disabl
- Page 650 and 651:
17.3 Panels ( panel ) 1. Definition
- Page 652 and 653:
int M.open(window& W, int x, int y)
- Page 654 and 655:
17.6 Graph Windows ( GraphWin ) 1.
- Page 656 and 657:
The corresponding types are: gw_nod
- Page 658 and 659:
void gw.set frame label(const char
- Page 660 and 661:
int gw.set gen edges(int m) sets th
- Page 662 and 663:
ool gw.is selected(edge e) returns
- Page 664 and 665:
void gw.place into box(double x0 ,
- Page 666 and 667:
void gw.add edge menu(string label,
- Page 668 and 669:
void void void int gw.add separator
- Page 670 and 671:
ool gw.wait(const char ∗ msg) dis
- Page 672 and 673:
17.7 The GraphWin (GW) File Format
- Page 674 and 675:
order color an attribute of type in
- Page 676 and 677:
direction an attribute of type int
- Page 678 and 679:
0.9074733 1 0 0 1 1 1 5 (0,0) (0,0)
- Page 680 and 681:
changes. The contents of the result
- Page 682 and 683:
The geometric objects The objects s
- Page 684 and 685:
• (rat )gen polygon or a d3 point
- Page 686 and 687:
ool write postscript(const CONTAINE
- Page 688 and 689:
eturn 0; } template void GW.set up
- Page 690 and 691:
void GW.set selected objects(GeoEdi
- Page 692 and 693:
ool GW.get show status( ) return bo
- Page 694 and 695:
string string color GW.get name(geo
- Page 696 and 697:
ool GW.set visible(geo scene sc, bo
- Page 698 and 699:
#include #include using namespace
- Page 700 and 701:
template line style GW.set obj lin
- Page 702 and 703:
template bool GW.get obj text(GeoB
- Page 704 and 705:
ool GW.set show position(bool sp) s
- Page 706 and 707:
• Pre add handler • Pre add cha
- Page 708 and 709:
ool GW.set post rotate handler(GeoE
- Page 710 and 711:
void void void void void int int GW
- Page 712 and 713:
void GW.add dependence(geo scene sc
- Page 714 and 715:
int GW.set limit(GeoEditScene ∗ e
- Page 716 and 717:
#include < LEDA/graphics/d3 window.
- Page 718 and 719:
string D.set message(string msg) se
- Page 720 and 721:
18.2 User Implementations In additi
- Page 722 and 723:
18.2.2 Priority Queues Any class pr
- Page 725 and 726:
Appendix A Technical Information Th
- Page 727 and 728:
A.3 Source Code on UNIX Platforms S
- Page 729 and 730:
A.5 Source Code on Windows with Bor
- Page 731 and 732:
Preparations Unpacking the LEDA dis
- Page 733 and 734:
Files and Directories To compile an
- Page 735 and 736:
(13) Choose ”Directories” (14)
- Page 737 and 738:
Possible values for are ”-ML”,
- Page 739 and 740:
(5’) In the ”File” menu click
- Page 741 and 742:
1. Change the file autoexec.bat as
- Page 743 and 744:
Compiling and Linking in Microsoft
- Page 745 and 746:
Compiling and Linking Application P
- Page 747 and 748:
Preparations To install LEDA you on
- Page 749 and 750:
(9b) Click on ”C/C++” and ”Pr
- Page 751 and 752:
2. Restart Windows 95/98 for the ch
- Page 753 and 754:
Programs using graph data types: bc
- Page 755 and 756:
• Make sure that there is a file
- Page 757 and 758:
Appendix B The golden LEDA rules Th
- Page 759 and 760:
(c) If y is the copy of a value x o
- Page 761 and 762:
4. list_item it = L.first(); L.del_
- Page 763 and 764:
Appendix C The LEDA Tools for Manua
- Page 765 and 766:
#ifndef LEDA_STACK_H #define LEDA_S
- Page 767:
foo.[lw|nw|w] lextract ❄ foo.man
- Page 770 and 771:
[15] C. Burnikel, R. Fleischer, K.
- Page 772 and 773:
[49] T. Iwata, K. Kurosawa: “OMAC
- Page 774 and 775:
[85] R.E. Tarjan: “Depth First Se
- Page 776 and 777:
acknowledge(...) GraphWin . . . . .
- Page 778 and 779:
BELLMAN FORD T(...) . . . . . . . .
- Page 780 and 781:
point . . . . . . . . . . . . . . .
- Page 782 and 783:
dynamic markov chain . . . . . . .
- Page 784 and 785:
del min() b node pq . . . . . . . .
- Page 786 and 787:
draw hull(...) POINT SET . . . . .
- Page 788 and 789:
MTFCoder . . . . . . . . . . . . .
- Page 790 and 791:
forall in edges(...). . . . . . . .
- Page 792 and 793:
get edit edge() GraphWin . . . . .
- Page 794 and 795:
get param(...) GraphWin . . . . . .
- Page 796 and 797:
eal . . . . . . . . . . . . . . . .
- Page 798 and 799:
dictionary . . . . . . . . . . . .
- Page 800 and 801:
is hidden(...) graph . . . . . . .
- Page 802 and 803:
language date . . . . . . . . . . .
- Page 804 and 805:
maximal planar graph(...). . . . .
- Page 806 and 807:
at triangle . . . . . . . . . . . .
- Page 808 and 809:
eal triangle . . . . . . . . . . .
- Page 810 and 811:
project yz(...) d3 line . . . . . .
- Page 812 and 813:
d3 plane . . . . . . . . . . . . .
- Page 814 and 815:
circle segment . . . . . . . . . .
- Page 816 and 817:
window . . . . . . . . . . . . . .
- Page 818 and 819:
set keys in file(...) CryptAutoDeco
- Page 820 and 821:
GraphWin . . . . . . . . . . . . .
- Page 822 and 823:
priority queue. . . . . . . . . . .
- Page 824 and 825:
STRONG COMPONENTS(...) . . . . . .
- Page 826 and 827:
d3 sphere . . . . . . . . . . . . .
- Page 828 and 829:
W1() rat segment . . . . . . . . .
- Page 830:
eal rectangle . . . . . . . . . . .