Simple Data Types
Basic Data Types
Advanced Data Types
Number Types
Graphs
Graph Algorithms
Geometry
Geometry Algorithms
Windows and Panels
GraphWin
GeoWin
Strings
File and String Streams
Random Sources
Random Variates
Dynamic Random Variates
Memory Management
Memory Allocator
Error Handling
Files and Directories
Miscellaneous Useful Functions
Tuples
Date
One Dimensional Arrays
Two Dimensional Arrays
Linear Lists
Singly Linked Lists
Sets
Integer Sets
Dynamic Integer Sets
Stacks and Queues
Bounded Stacks and Queues
Partitions
Parameterized Partitions
Dynamic Trees
Collection of Trees
Dictionaries
Sorted Sequences
Dictionary Arrays
Hashing Arrays
Maps
Two Dimensional Maps
Persistent Dictionaries
Partially Persistent Dictionaries
Priority Queues
Bounded Priority Queues
Integers of Arbitrary Length
Rational Numbers
Algebraic Real Numbers
Big Floating-point Numbers
Floating Point Filter
Double Valued Vectors and Matrices
Vectors and Matrices with Integer Entries
Vectors with Rational Entries
Functions of Numerical Analysis
Parameterized Graphs
Planar Maps
Parameterized Planar Maps
Node Arrays
Edge Arrays
Face Arrays
Node Maps
Edge Maps
Face Maps
Two Dimensional Node Arrays
Two Dimensional Node Maps
Special Graph Constructor G(int n_slots,int e_slots)
Sets of Nodes
Sets of Edges
Lists of Nodes
Node Partitions
Node Priority Queues
Bounded Node Priority Queues
Graph Generators
Miscellaneous Graph Functions
Markov Chains and Dynamic Markov Chains
GML Parser for Graphs
LEDA Native Graph File Format
Basic Graph Algorithms
Topological Ordering
Depth First Search and Breadth First Search
Connected Components
Strongly Connected Components
Biconnected Components
Transitive Closure
Shortest Path Algorithms
Single Source Shortest Paths
All Pairs Shortest Paths
Minimum Cost Ratio Cycle
Matching Algorithms
Maximum Cardinality Matching in Bipartite Graphs
Bipartite Weighted Matching
Bipartite Weighted Assignment
Bipartite Maximum Weighted Maximum Cardinality Matching
Maximum Cardinality Matching in General Graphs
Weighted Matching in General Graphs
Maximum Flow
Minimum Cost Flow
Minimum Cut
Spanning Trees and Minimum Spanning Trees
Algorithms for Planar Graphs
Algorithms for Drawing Graphs
Geometry Objects
Data types for two-dimensional geometry
Advanced Data types for 2-D geometry
Data types for three-dimensional geometry
Basics
Cartesian and Homogeneous Coordinates
Handle Types, Identity, and Equality
Associating Information with Geometric Objects
Converting Between Rational and Floating Point Kernel
Immutability
Input and Output
Geometric Primitives
Orientation and Sidedness
Length and Distance
Angles
Intersections
Affine Transformations
Generators for Geometric Objects
Writing Kernel Independent Code
The Dangers of Floating Point Arithmetic
Two-Dimensional Dictionaries
Point Sets (Dynamic Delaunay Triangulations)
Sets of Intervals
Sets of Parallel Segments
Planar Subdivisions
Convex Hulls and The Width of a Point Set
Triangulations
Delaunay Triangulations
Delaunay Diagrams and Euclidean Minimum Spanning Trees
Voronoi Diagrams
Extremal Circles Minimum Width and Minimum Area Annuli Curve Reconstruction
Extremal Circles
Minimum Width and Minimum Area Annuli
Curve Reconstruction
Duality between Voronoi and Delaunay Diagrams
Line Segment Intersection
Verification of Geometric Structures
Convex Components Minkowski Sums
Closest Pairs
Drawing Section of a Window
Pixel and User Coordinates
Colors
Window Parameters
Input and Output Operators
Drawing Operations
Pixrects (Pixmaps)
Bitmaps
Clip Regions
Buffering
Mouse Input
Events
Timers
Displaying Three-Dimensional Objects
Panel Section of a Window
Panel Items
Panel Buttons
The Interactive Interface
Attributes and Parameters
The Programming Interface
Creating and Opening Graph Operations Attribute and Parameter Operations Input and Output Operations Layout Operations Zoom Operations Miscellaneous Operations
Creating and Opening
Graph Operations
Attribute and Parameter Operations
Input and Output Operations
Layout Operations
Zoom Operations
Miscellaneous Operations
Customizing the Interactive Interface
Call-Back Functions
A Recipe for Online Demos of Graph Algorithms
Defining Edit Actions
Edit and Run: A Simple Recipe for Interactive Demos
A Recipe for Online Demos of Network Algorithms
GraphWin File Format