\chapter{Class Overview}
\label{Class Overview}

\tablefirsthead{\hline{\bf Class} & {\bf Header} & {\bf Library} & {\bf Page}\\\hline}
\tablehead{\multicolumn{4}{l}{\small\slshape continued from previous page}\\
	\hline{\bf Class} & {\bf Header} & {\bf Library} & {\bf Page}\\\hline}
\tabletail{\hline\multicolumn{4}{r}{\small\slshape continued on next page}\\}
\tablelasttail{\\\hline}

\begin{supertabular}{|l|l|l|r|}
AGD & AGD.h & libAGD & \pageref{AGD Base}\\
AgdKey & AgdKey.h & libAGD & \pageref{Keys}\\
AGDLayout & AGDLayout.h & libAGD & \pageref{Layouts}\\
AGDModule & AGDModule.h & libAGD & \pageref{AGD Modules}\\
AGDModuleOption & AGDModuleOption.h & libAGD & \pageref{Module Options}\\
AugmentationModule & AugmentationModule.h & libAGD & \pageref{Augmentation Modules}\\\hline
BarycenterHeuristic & BarycenterHeuristic.h & libAGD & \pageref{Barycenter Heuristic}\\\hline
CanonicalOrder & CanonicalOrder.h & libAGD & \pageref{The Canonical Ordering of a Graph}\\
CGGridLayout & CGGridLayout.h & libAGD & \pageref{Grid Layouts for Cluster Graphs} \\
CGGridLayoutInfo & CGGridLayoutInfo.h & libAGD & \pageref{Grid Layout Infos for Cluster Graphs} \\
CGGridLayoutModule & CGGridLayoutModule.h & libAGD & \pageref{Cluster Graph Grid Layout Algorithms} \\
CGGridLayoutModuleImpl & CGGridLayoutModuleImpl.h & libAGD & \pageref{Implementation of Clustergraph Grid Layout Algorithms} \\
CGLayout & CGLayout.h & libAGD & \pageref{Cluster Graph Layouts} \\
CGLayoutInterface & CGLayoutInterface.h & libAGD & \pageref{Layout Interfaces for Cluster Graphs} \\
CGLayoutModule & CGLayoutModule.h & libAGD & \pageref{Cluster Graph Layout Algorithms} \\
CGPlaneGraphCopyGridConcept & CGPlaneGraphCopyGridConcept.h & libAGD & \pageref{Grid Concept for Plane Cluster Graph Copies} \\
CGraphWin & CGraphWin.h & libAGD & \pageref{GraphWin for Cluster Graphs} \\
CGraphWinInterface & CGraphWinInterface.h & libAGD & \pageref{Interface to CGraphWin} \\
Cluster & Cluster.h & libAGD & \pageref{Clusters}\\
ClusterGraph & ClusterGraph.h & libAGD & \pageref{Cluster Graphs}\\
ClusterGraphChecker & ClusterGraphChecker.h & libAGD & \pageref{Cluster Graph Checker}\\
ClusterGraphGLI & ClusterGraphGLI.h & libAGD & \pageref{GLI's for Cluster Graphs} \\
ClusterOrthogonalLayout & ClusterOrthogonalLayout.h & libAGD & \pageref{The Cluster-Orthogonal Algorithm} \\
CoffmanGrahamRanking & CoffmanGrahamRanking.h & libAGD & \pageref{Ranking with Predefined Width}\\
CompactionModule & CompactionModule.h & libAGD & \pageref{Compaction Modules}\\
CondBase & CondBase.h & libAGD & \pageref{Base Class for Pre- and Postconditions}\\
ConstLedaGraphConcept & ConstLedaGraphConcept.h & libAGD & \pageref{Concept for LEDA Graphs}\\
ConstLedaGraphGridConcept & ConstLedaGraphGridConcept.h & libAGD & \pageref{Grid Concept for LEDA Graphs}\\
ConvexDrawLayout & ConvexDrawLayout.h & libAGD & \pageref{The ConvexDraw Algorithm}\\
ConvexLayout & ConvexLayout.h & libAGD & \pageref{The Convex Algorithm}\\
CPlanarEmbed & CPlanrEmbed.h & libAGD & \pageref{C-Planarity Embedding} \\\hline
DefaultKeymapper & DefaultKeymapper.h & libAGD & \pageref{Default Keymappers}\\
DefaultRuleAdmin & DefaultRuleAdmin.h & libAGD & \pageref{Default Rule Administrators}\\
DfsRanking & DfsRanking.h & libAGD & \pageref{Ranking by Depth First Search}\\
DPoint & DPoint.h & libAGD & \pageref{Double Points}\\
DPolyline & DPolyline.h & libAGD & \pageref{Double Polylines}\\
DRect & DRect.h & libAGD & \pageref{Double Rectangles}\\
DSegment & DSegment.h & libAGD & \pageref{Double Line Segments}\\\hline
EdgeInsertionModule & EdgeInsertionModule.h & libAGD & \pageref{Edge Insertion Modules}\\\hline
FastHierarchyLayout & FastHierarchyLayout.h & libAGD & \pageref{Fast Layout of Hierarchies}\\
FixedGridMapper & FixedGridMapper.h & libAGD & \pageref{Mapping with Fixed Grid Width}\\
FixedSizeMapper & FixedSizeMapper.h & libAGD & \pageref{Mapping with Fixed Size}\\
FPPLayout & FPPLayout.h & libAGD & \pageref{The de Fraysseix, Pach, Pollack Algorithm}\\\hline
GraphChecker & GraphChecker.h & libAGD & \pageref{Graph Checker}\\
GraphCopy & GraphCopy.h & libAGD & \pageref{Graph Copies}\\
GraphCopyConcept & GraphCopyConcept.h & libAGD & \pageref{Concept for Graph Copies}\\
GraphCopyGLI & GraphCopyGLI.h & libAGD & \pageref{GLI's for Graph Copies}\\
GraphCopyGridConcept & GraphCopyGridConcept.h & libAGD & \pageref{Grid Concept for Graph Copies}\\
GraphCopyLI & GraphCopyLI.h & libAGD & \pageref{Layout Interface for Graph Copies}\\
GraphGLI & GraphGLI.h & libAGD & \pageref{GLI's for Graphs}\\
GraphWinAnimInterface & GraphWinAnimInterface.h & libAGD & \pageref{Interface with Animation to GraphWin}\\
GraphWinInterface & GraphWinInterface.h & libAGD & \pageref{Interface to GraphWin}\\
GreedyCycleRemoval & GreedyCycleRemoval.h & libAGD & \pageref{Greedy Cycle Removal}\\
GreedyInsertHeuristic & GreedyInsertHeuristic.h & libAGD & \pageref{Greedy Insert}\\
GreedySwitchHeuristic & GreedySwitchHeuristic.h & libAGD & \pageref{Greedy Switch}\\
GridCoordinateMapper & GridCoordinateMapper.h & libAGD & \pageref{Grid Coordinate Mapper}\\
GridLayout & GridLayout.h & libAGD & \pageref{Grid Layouts}\\
GridLayoutInfo & GridLayoutInfo.h & libAGD & \pageref{Grid Layout Infos}\\
GridLayoutModule & GridLayoutModule.h & libAGD & \pageref{Grid Layout Algorithms}\\
GridLayoutModuleImpl & GridLayoutModuleImpl.h & libAGD & \pageref{Implementation of Grid Layout Algorithms}\\\hline
Hierarchy & Hierarchy.h & libAGD & \pageref{Node Hierarchies}\\
HierarchyLayoutModule & HierarchyLayoutModule.h & libAGD & \pageref{Hierarchy Layout Modules}\\\hline
IPoint & IPoint.h & libAGD & \pageref{Integer Points}\\
IPolyline & IPolyline.h & libAGD & \pageref{Integer Polylines}\\
IRect & IRect.h & libAGD & \pageref{Integer Rectangles}\\
ISegment & ISegment.h & libAGD & \pageref{Integer Line Segments}\\\hline
Keymapper & Keymapper.h & libAGD & \pageref{Key Mappers}\\
Keymapper::const\_iterator & Keymapper.h & libAGD & \pageref{Keymapper Iterators}\\
KeySet & KeySet.h & libAGD & \pageref{Key Sets}\\
KeySet::const\_iterator & KeySet.h & libAGD & \pageref{Key Set Iterators}\\\hline
Layer & Layer.h & libAGD & \pageref{Layers of Hierarchies}\\
LayoutBuffer & LayoutBuffer.h & libAGD & \pageref{Layout Buffers}\\
LayoutInterface & LayoutInterface.h & libAGD & \pageref{Layout Interfaces}\\
LayoutModule & LayoutModule.h & libAGD & \pageref{Layout Algorithms}\\
LayoutModuleImpl & LayoutModuleImpl.h & libAGD & \pageref{Implementation of Layout Algorithms}\\
LEDAMakeAcyclic & LEDAMakeAcyclic.h & libAGD & \pageref{LEDA's Make Acyclic} \\
LEDAMakeBiconnected & LEDAMakeBiconnected.h & libAGD & \pageref{LEDA's Make Biconnected}\\
LeveledGraph & LeveledGraph.h & libAGD & \pageref{Leveled Graphs}\\
LmcOrder & CanonicalOrder.h & libAGD & \pageref{The Leftmost Canonical Order of a Graph}\\
LongestPathCompaction & LongestPathCompaction.h & libAGD & \pageref{Longest Path--Based One--dim. Compaction}\\
LongestPathRanking & LongestPathRanking.h & libAGD & \pageref{Ranking to Minimize Height}\\\hline
MaxAllMapper & MaxAllMapper.h & libAGD & \pageref{Mapping with Equal Sized Grid Width}\\
MaxEachMapper & MaxEachMapper.h & libAGD & \pageref{Mapping with Adjusted Grid Width}\\
MedianHeuristic & MedianHeuristic.h & libAGD & \pageref{Median Heuristic}\\
MixedModelLayout & MixedModelLayout.h & libAGD & \pageref{The Mixed-Model Algorithm}\\\hline
OptAcyclicSubgraph & OptAcyclicSubgraph.h & libAGDopt & \pageref{Maximum Acyclic Subgraph}\\
OptCompCoord & OptCompCoord.h & libAGDopt & \pageref{Optimal Layout of Hierarchies} \\
OptCrossMin & OptCrossMin.h & libAGDopt & \pageref{Optimal Crossing Minimization}\\
OptNodeRanking & OptNodeRanking.h & libAGDopt & \pageref{Ranking to Minimize Edge Lengths} \\
OptPlanarSubgraph & OptPlanarSubgraph.h & libAGDopt & \pageref{Maximum Planar Subgraphs}\\
OptPlanAug & OptPlanAug.h & libAGDopt & \pageref{Optimal Planar Biconnected}\\
OrderSet & CanonicalOrder.h & libAGD & \pageref{Sets of a Canonical Ordering}\\
OrthogonalLayout & OrthogonalLayout.h & libAGD & \pageref{The Orthogonal Drawing Algorithm}\\
OrthogonalRepresentation & OrthogonalRepresentation.h & libAGD & \pageref{Orthogonal Representations}\\
OrthoRepGridConcept & OrthoRepGridConcept.h & libAGD & \pageref{Grid Concept for Orthogonal Representations} \\\hline
PertinentGraph & PertinentGraph.h & libAGD & \pageref{Pertinent Graphs}\\
PlanarDrawLayout & PlanarDrawLayout.h & libAGD & \pageref{The PlanarDraw Algorithm}\\
PlanarizationGridLayout & PlanarizationGridLayout.h & libAGD & \pageref{Planarization on the Grid}\\
PlanarizationLayout & PlanarizationLayout.h & libAGD & \pageref{The Planarization Method}\\
PlanarizerModule & PlanarizerModule.h & libAGD & \pageref{Planarization Modules}\\
PlanarSPQRTree & PlanarSPQRTree.h & libAGD & \pageref{SPQR-Trees for Planar Graphs} \\
PlanarStraightLayout & PlanarStraightLayout.h & libAGD & \pageref{The PlanarStraight Algorithm}\\
PlanarSubgraph & PlanarSubgraph.h & libAGD & \pageref{Planar Subgraphs}\\
PlanAug & PlanAug.h & libAGD & \pageref{Planar Biconnected}\\
PlaneClusterGraphCopy & PlaneClusterGraphCopy.h & libAGD & \pageref{Plane Cluster Graph Copies}\\
PlaneGraphCopy & PlaneGraphCopy.h & libAGD & \pageref{Plane Graph Copies}\\
PlaneGraphCopyGridConcept & PlaneGraphCopyGridConcept.h & libAGD & \pageref{Grid Concept for Plane Graph Copies}\\
PostCond & PostCond.h & libAGD & \pageref{Postconditions}\\
PostCondRule & PostCondRule.h & libAGD & \pageref{Postcondition Rules}\\
PreCond & PreCond.h & libAGD & \pageref{Preconditions}\\
PSInterface & PSInterface.h & libAGD & \pageref{Interface to PostScript}\\
PureOrthogonalLayout & PureOrthogonalLayout.h & libAGD & \pageref{The Pure Orthogonal Drawing Algorithm}\\\hline
QuasiOrthogonalLayout & QuasiOrthogonalLayout.h & libAGD & \pageref{The Quasi--Orthogonal Drawing Algorithm}\\\hline
RankAssignment & RankAssignment.h & libAGD & \pageref{RankAssignment Modules}\\
ReducedDigraph & ReducedDigraph.h & libAGD & \pageref{Reduced Digraphs}\\
Rule & Rule.h & libAGD & \pageref{Rules}\\
RuleAdmin & RuleAdmin.h & libAGD & \pageref{Rule Administrators}\\
RuleAdmin::const\_iterator & RuleAdmin.h & libAGD & \pageref{Rule System Iterators}\\\hline
SchnyderLayout & SchnyderLayout.h & libAGD & \pageref{The Schnyder Algorithm}\\
ShapeModule & ShapeModule.h & libAGD & \pageref{Shape Module}\\
ShortestPathInserter & ShortestPathInserter.h & libAGD & \pageref{Shortest Path Edge Inserter}\\
SiftingHeuristic & SiftingHeuristic.h & libAGD & \pageref{Sifting Heuristic}\\
Skeleton & Skeleton.h & libAGD & \pageref{Skeletons}\\
SplitHeuristic & SplitHeuristic.h & libAGD & \pageref{Split Heuristic}\\
SPQRTree & SPQRTree.h & libAGD & \pageref{SPQR-Trees}\\
SpringLayout & SpringLayout.h & libAGD & \pageref{Spring Embedder}\\
SubgraphChecker & SubgraphChecker.h & libAGD & \pageref{Subgraph Checker}\\
SubgraphModule & SubgraphModule.h & libAGD & \pageref{Subgraph Modules}\\
SubgraphPlanarizer & SubgraphPlanarizer.h & libAGD & \pageref{Planarization with Planar Subgraph}\\
SugiyamaLayout & SugiyamaLayout.h & libAGD & \pageref{Sugiyama's Algorithm}\\\hline
TaggedRule & TaggedRule.h & libAGD & \pageref{Tagged Rules}\\
TopologyModule & TopologoyModule.h & libAGD & \pageref{Topology Modules}\\
TreeLayout & TreeLayout.h & libAGD & \pageref{Walker's Algorithm}\\
TriconnectivityTest & TriconnectivityTest.h & libAGD & \pageref{Testing Triconnectivity}\\
TRLiteral & TRLiteral.h & libAGD & \pageref{Tagged Rule Literals}\\
TutteLayout & TutteLayout.h & libAGD & \pageref{Tutte's Algorithm}\\
TwoLayerCrossMin & TwoLayerCrossMin.h & libAGD & \pageref{Two Layer Crossing Minimization}\\\hline
VisibilityRepresentation & VisibilityRepresentation.h & libAGD & \pageref{Visibility Representation}\\\hline
WeightedMedianHeuristic & WeightedMedianHeuristic.h & libAGD & \pageref{Weighted Median Heuristic}
\end{supertabular}
