\chapter{Tables} \label{Tables}

\section{Data Types} \label{Table Data Types}

\begin{tabular}{lllll}
{\bf Name}         &{\bf Item}      &{\bf Header}      &{\bf Library}  &{\bf Page}\\
array              &------          &array.h           &libL.a         &\pageref{One Dimensional Arrays}\\
array2             &------          &array2.h          &libL.a         &\pageref{Two Dimensional Arrays}\\
b\_node\_pq        &------          &b\_node\_pq.h     &libG.a         &\pageref{Bounded Node Priority Queues}\\
b\_priority\_queue &b\_pq\_item     &b\_prio.h         &libL.a         &\pageref{Bounded Priority Queues}\\
b\_queue           &------          &b\_queue.h        &libL.a         &\pageref{Bounded Queues}\\
b\_stack           &------          &b\_stack.h        &libL.a         &\pageref{Bounded Stacks}\\
circle             &------          &circle.h           &libP.a         &\pageref{Circles}\\
cmd\_istream       &------          &stream.h          &libL.a         &\pageref{Command Input Streams}\\
cmd\_ostream       &------          &stream.h          &libL.a         &\pageref{Command Output Streams}\\
d2\_dictionary      &d2\_dic\_item   &d2\_dictionary.h  &libP.a         &\pageref{Two-Dimensional Dictionaries}\\
d\_array            &------          &d\_array.h        &libL.a         &\pageref{Dictionary Arrays}\\
dictionary          &dic\_item       &dictionary.h      &libL.a         &\pageref{Dictionaries}\\
edge\_array         &------          &edge\_array.h     &libG.a         &\pageref{Edge Arrays}\\
edge\_map           &------          &edge\_map.h        &libG.a         &\pageref{Edge Maps}\\
edge\_set           &------          &edge\_set.h       &libG.a         &\pageref{Sets of Edges}\\
file\_istream       &------          &stream.h          &libL.a         &\pageref{File Input Streams}\\
file\_ostream       &------          &stream.h          &libL.a         &\pageref{File Output Streams}\\
floatf              &------          &floatf.h          &libL.a         &\pageref{A Floating Point Filter}\\
graph               &node/edge       &graph.h           &libG.a         &\pageref{Graphs}\\
GRAPH               &node/edge       &graph.h           &libG.a         &\pageref{Parameterized Graphs}\\
h\_array            &------          &h\_array.h        &libL.a         &\pageref{Hashing Arrays}\\
integer             &------          &integer.h         &libL.a         &\pageref{Integers of Arbitrary Length}\\
int\_set            &------          &int\_set.h        &libL.a         &\pageref{Integer Sets}\\
interval\_set       &is\_item        &interval\_set.h   &libP.a         &\pageref{Sets of Intervals}\\
line                &------          &line.h            &libP.a         &\pageref{Straight Lines}\\
list                &list\_item      &list.h            &libL.a         &\pageref{Linear Lists}\\
map                 &------          &map.h             &libL.a         &\pageref{Maps}\\
matrix              &------          &matrix.h          &libL.a         &\pageref{Real-Valued Matrices}\\
node\_array         &------          &node\_array.h     &libG.a         &\pageref{Node Arrays}\\
node\_list          &------          &node\_list.h       &libG.a         &\pageref{Lists of Nodes}\\
node\_map           &------          &node\_map.h        &libG.a         &\pageref{Node Maps}\\
\end{tabular}

\begin{tabular}{lllll}
node\_matrix        &------          &graph.h           &libG.a         &\pageref{Two Dimensional Node Arrays}\\
node\_partition     &------          &node\_partition.h &libG.a         &\pageref{Node Partitions}\\
node\_pq            &------          &node\_pq.h        &libG.a         &\pageref{Node Priority Queues}\\
node\_set           &------          &node\_set.h       &libG.a         &\pageref{Sets of Nodes}\\
panel               &------          &panel.h           &libP.a/libWx.a &\pageref{Panels}\\
partition           &partition\_item &partition.h       &libL.a         &\pageref{Partitions}\\
planar\_map         &node/edge/face  &planar\_map.h     &libG.a         &\pageref{Planar Maps}\\
point               &------          &point.h           &libP.a         &\pageref{Points}\\
point\_set          &ps\_item        &point\_set.h      &libP.a         &\pageref{Sets of Two-Dimensional Points}\\
polygon             &------          &polygon.h         &libP.a         &\pageref{Polygons}\\
p\_queue            &pq\_item        &p\_queue.h         &libL.a         &\pageref{Priority Queues}\\
p\_dictionary       &p\_dic\_item    &p\_dictionary.h   &libL.a         &\pageref{Persistent Dictionaries}\\
PLANAR\_MAP         &node/edge/face  &planar\_map.h     &libG.a         &\pageref{Parameterized Planar Maps}\\
queue               &------          &queue.h           &libL.a         &\pageref{Queues}\\
rational            &------          &rational.h        &libL.a         &\pageref{Rational Numbers}\\
rat\_point          &------          &rat\_point.h      &libP.a         &\pageref{Rational Points}\\
rat\_segment        &------          &rat\_segment.h    &libP.a         &\pageref{Rational Segments}\\
real                &------          &real.h            &libL.a         &\pageref{Real Numbers}\\
segment             &------          &segment.h         &libP.a         &\pageref{Segments}\\
segment\_set        &seg\_item       &segment\_set.h    &libP.a         &\pageref{Sets of Parallel Segments}\\
set                 &------          &set.h             &libL.a         &\pageref{Sets}\\
sortseq             &seq\_item       &sortseq.h         &libL.a         &\pageref{Sorted Sequences}\\
stack               &------          &stack.h           &libL.a         &\pageref{Stacks}\\
string              &------          &string.h          &libL.a         &\pageref{Strings}\\
string\_istream     &------          &stream.h          &libL.a         &\pageref{String Input Streams}\\
string\_ostream     &------          &stream.h          &libL.a         &\pageref{String Output Streams}\\
subdivision         &node/face       &subdivision.h     &libP.a         &\pageref{Planar Subdivisions}\\
tree\_collection    &d\_vertex       &tree\_collection.h&libL.a         &\pageref{Dynamic Collections of Trees}\\
ugraph              &node/edge       &ugraph.h          &libG.a         &\pageref{Undirected Graphs}\\
UGRAPH              &node/edge       &ugraph.h          &libG.a         &\pageref{Parameterized Ugraphs}\\
vector              &------          &vector.h          &libL.a         &\pageref{Real-Valued Vectors}\\
window              &------          &window.h          &libP.a/libWx.a &\pageref{Graphic Windows}\\
\end{tabular}


\newpage

\section{Algorithms}  \label{Table Algorithms}

\bigskip
\begin{tabular}{llll}
{\bf Name}                     &{\bf Header}      &{\bf Library}  &{\bf Page}\\
\noalign{\smallskip}
ALL\_PAIRS\_SHORTEST\_PATHS       &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
BELLMAN\_FORD                     &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
BFS                               &graph\_alg.h   &libG.a           &\pageref{Basic Algorithms}\\
COMPONENTS                        &graph\_alg.h   &libG.a           &\pageref{Basic Algorithms}\\
CONVEX\_HULL                      &plane\_alg.h   &libP.a           &\pageref{Plane Algorithms}\\
DFS                               &graph\_alg.h   &libG.a           &\pageref{Basic Algorithms}\\
DFS\_NUM                          &graph\_alg.h   &libG.a           &\pageref{Basic Algorithms}\\
DIJKSTRA                          &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
MAX\_CARD\_MATCHING               &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
MAX\_CARD\_BIPARTITE\_MATCHING    &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
MAX\_FLOW                         &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
MAX\_WEIGHT\_MATCHING             &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
MAX\_WEIGHT\_BIPARTITE\_MATCHING  &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
MIN\_CUT                          &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
MIN\_COST\_MAX\_FLOW              &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
MIN\_SPANNING\_TREE               &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
PLANAR                            &graph\_alg.h   &libG.a           &\pageref{Algorithms for Planar Graphs}\\
SEGMENT\_INTERSECTION             &plane\_alg.h   &libP.a           &\pageref{Plane Algorithms}\\
SPANNING\_TREE                    &graph\_alg.h   &libG.a           &\pageref{Network Algorithms}\\
STRAIGHT\_LINE\_EMBEDDING         &graph\_alg.h   &libG.a           &\pageref{Algorithms for Planar Graphs}\\
STRONG\_COMPONENTS                &graph\_alg.h   &libG.a           &\pageref{Basic Algorithms}\\
SWEEP\_SEGMENTS                   &plane\_alg.h   &libP.a           &\pageref{Plane Algorithms}\\
TOPSORT                           &graph\_alg.h   &libG.a           &\pageref{Basic Algorithms}\\
TRANSITIVE\_CLOSURE               &graph\_alg.h   &libG.a           &\pageref{Basic Algorithms}\\
TRIANGULATE\_PLANAR\_MAP          &graph\_alg.h   &libG.a           &\pageref{Algorithms for Planar Graphs}\\
VORONOI                           &plane\_alg.h   &libP.a           &\pageref{Plane Algorithms}
\end{tabular}

