Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
AbsMapAbsolute value of a map
AddMapSum of two maps
AllArcLookUpFast look-up of all arcs between given endpoints
AlterableDigraphComponentAn empty alteration notifier digraph class
AlterableGraphComponentAn empty alteration notifier undirected graph class
AndMapLogical 'and' of two maps
ArcLookUpFast arc look-up between given endpoints
ArgParserCommand line arguments parser
ArgParser::RefTypeMagic type for operator[]
BackwardMapReturns the "backward" directed arc view of an edge
BaseDigraphComponentAn empty base directed graph class
BaseGraphComponentAn empty base undirected graph class
BaseGraphComponent::EdgeUndirected arc class of the graph
BfsBFS algorithm class
Bfs::SetDistMapNamed parameter for setting DistMap type
Bfs::SetPredMapNamed parameter for setting PredMap type
Bfs::SetProcessedMapNamed parameter for setting ProcessedMap type
Bfs::SetReachedMapNamed parameter for setting ReachedMap type
Bfs::SetStandardProcessedMapNamed parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>
BfsDefaultTraitsDefault traits class of Bfs class
BfsVisitBFS algorithm class with visitor interface
BfsVisit::SetReachedMapNamed parameter for setting ReachedMap type
BfsVisitDefaultTraitsDefault traits class of BfsVisit class
BfsVisitorVisitor class for BFS
BfsWizardAuxiliary class for the function-type interface of BFS algorithm
BfsWizardBaseDefault traits class used by BfsWizard
BfsWizardDefaultTraitsDefault traits class of bfs() function
BinHeapA Binary Heap implementation
BoxBounding box of plain vectors (points)
ClearableDigraphComponentAn empty clearable base digraph class
ClearableGraphComponentAn empty clearable base undirected graph class
ColorData structure representing RGB colors
CombineMapCombination of two maps using an STL (binary) functor
ComposeMapComposition of two maps
ConArcItIterator for iterating on parallel arcs connecting the same nodes
ConEdgeItIterator for iterating on parallel edges connecting the same nodes
ConstMapConstant map
ConstMap< K, Const< V, v > >Constant map with inlined constant value
ConstXMap
ConstYMap
ConvertMapMap adaptor to convert the Value type of a map to another type using the default conversion
CounterA counter class
DefaultGraphToEpsTraitsDefault traits class of GraphToEps
DfsDFS algorithm class
Dfs::SetDistMapNamed parameter for setting DistMap type
Dfs::SetPredMapNamed parameter for setting PredMap type
Dfs::SetProcessedMapNamed parameter for setting ProcessedMap type
Dfs::SetReachedMapNamed parameter for setting ReachedMap type
Dfs::SetStandardProcessedMapNamed parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>
DfsDefaultTraitsDefault traits class of Dfs class
DfsVisitDFS algorithm class with visitor interface
DfsVisit::SetReachedMapNamed parameter for setting ReachedMap type
DfsVisitDefaultTraitsDefault traits class of DfsVisit class
DfsVisitorVisitor class for DFS
DfsWizardAuxiliary class for the function-type interface of DFS algorithm
DfsWizardBaseDefault traits class used by DfsWizard
DfsWizardDefaultTraitsDefault traits class of dfs() function
DigraphClass describing the concept of directed graphs
Digraph::ArcClass for identifying an arc of the digraph
Digraph::ArcItThis iterator goes through each arc
Digraph::ArcMapRead write map of the arcs to type T
Digraph::InArcItThis iterator goes trough the incoming arcs of a node
Digraph::NodeClass for identifying a node of the digraph
Digraph::NodeItThis iterator goes through each node
Digraph::NodeMapRead write map of the nodes to type T
Digraph::OutArcItThis iterator goes trough the outgoing arcs of a node
DigraphCopyClass to copy a digraph
DigraphReaderLGF reader for directed graphs
DigraphWriterLGF writer for directed graphs
DijkstraDijkstra algorithm class
Dijkstra::SetDistMapNamed parameter for setting DistMap type
Dijkstra::SetHeapNamed parameter for setting heap and cross reference type
Dijkstra::SetOperationTraitsNamed parameter for setting OperationTraits type
Dijkstra::SetPredMapNamed parameter for setting PredMap type
Dijkstra::SetProcessedMapNamed parameter for setting ProcessedMap type
Dijkstra::SetStandardHeapNamed parameter for setting heap and cross reference type with automatic allocation
Dijkstra::SetStandardProcessedMapNamed parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>
DijkstraDefaultOperationTraitsDefault operation traits for the Dijkstra algorithm class
DijkstraDefaultTraitsDefault traits class of Dijkstra class
DijkstraWizardAuxiliary class for the function-type interface of Dijkstra algorithm
DijkstraWizardBaseDefault traits class used by DijkstraWizard
DijkstraWizardDefaultTraitsDefault traits class of dijkstra() function
DivMapQuotient of two maps
DynArcLookUpDynamic arc look-up between given endpoints
EqualMapCombination of two maps using the == operator
ErasableDigraphComponentAn empty erasable digraph class
ErasableGraphComponentAn empty erasable base undirected graph class
ExceptionGeneric exception class
ExtendableDigraphComponentAn empty extendable digraph class
ExtendableGraphComponentAn empty extendable base undirected graph class
ExtendFindEnumA Extend-Find data structure implementation which is able to enumerate the components
ExtendFindEnum::ClassItLEMON style iterator for the classes
ExtendFindEnum::ItemItLEMON style iterator for the items of a component
FalseMapConstant false map
ForkMapApplies all map setting operations to two maps
FormatErrorFormat error
ForwardMapReturns the "forward" directed arc view of an edge
FunctorToMapConverts an STL style (unary) functor to a map
GraphClass describing the concept of Undirected Graphs
Graph::ArcThe directed arc type
Graph::ArcItThis iterator goes through each directed arc
Graph::ArcMapRead write map of the directed arcs to type T
Graph::EdgeThe base type of the edge iterators
Graph::EdgeItThis iterator goes through each edge
Graph::EdgeMapRead write map of the edges to type T
Graph::InArcItThis iterator goes trough the incoming directed arcs of a node
Graph::IncEdgeItThis iterator goes trough the incident undirected arcs of a node
Graph::NodeThe base type of node iterators, or in other words, the trivial node iterator
Graph::NodeItThis iterator goes through each node
Graph::NodeMapRead write map of the nodes to type T
Graph::OutArcItThis iterator goes trough the outgoing directed arcs of a node
GraphCopyClass to copy a graph
GraphIncItSkeleton class for graph InArcIt and OutArcIt
GraphItemSkeleton class for graph Node and Arc types
GraphItemItSkeleton class for graph NodeIt and ArcIt
GraphMapClass describing the concept of graph maps
GraphReaderLGF reader for undirected graphs
GraphToEpsAuxiliary class to implement the named parameters of graphToEps()
GraphWriterLGF writer for directed graphs
HeapThe heap concept
HeapUnionFindA Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class
HeapUnionFind::ClassItClass iterator
HeapUnionFind::ItemItLEMON style iterator for the items of a class
IDableDigraphComponentAn empty idable base digraph class
IDableGraphComponentAn empty idable base undirected graph class
IdentityMapIdentity map
IdMapProvides an immutable and unique id for each item in the graph
IdMap::InverseMapThe class represents the inverse of its owner (IdMap)
InDegMapMap of the node in-degrees
InvalidDummy type to make it easier to create invalid iterators
IoErrorInput-Output error
IterableDigraphComponentAn empty iterable digraph class
IterableGraphComponentAn empty iterable undirected graph class
LessMapCombination of two maps using the < operator
LgfContentsReader for the contents of the LGF file
ListDigraphA general directed graph structure
ListDigraph::SnapshotClass to make a snapshot of the digraph and restore it later
ListGraphA general undirected graph structure
ListGraph::SnapshotClass to make a snapshot of the graph and restore it later
ListPathA structure for representing directed paths in a digraph
ListPath::ArcItIterator class to iterate on the arcs of the paths
LoggerBoolMapWritable bool map for logging each true assigned element
MapBaseBase class of maps
MappableDigraphComponentAn empty mappable digraph class
MappableDigraphComponent::ArcMapReadWrite map of the arcs
MappableDigraphComponent::NodeMapReadWrite map of the nodes
MappableGraphComponentAn empty mappable base bipartite graph class
MappableGraphComponent::EdgeMapReadWrite map of the edges
MapToFunctorConverts a map to an STL style (unary) functor
MulMapProduct of two maps
NegMapNegative of a map
NegWriteMapNegative of a map (read-write version)
NoCounter'Do nothing' version of Counter
NormSquareMapMap of the normSquare() of a Point-map
NoTimeReport'Do nothing' version of TimeReport
NotMapLogical 'not' of a map
NotWriteMapLogical 'not' of a map (read-write version)
NullMapNull map. (a.k.a. DoNothingMap)
OrMapLogical 'or' of two maps
OutDegMapMap of the node out-degrees
PaletteMap ints to different Colors
PathA skeleton structure for representing directed paths in a digraph
PathA structure for representing directed paths in a digraph
Path::ArcItLEMON style iterator for path arcs
Path::ArcItLEMON style iterator for path arcs
PathDumperA skeleton structure for path dumpers
PathDumper::ArcItLEMON style iterator for path arcs
PathDumper::RevArcItLEMON style iterator for path arcs
PathNodeItClass which helps to iterate through the nodes of a path
PointTwo dimensional vector (plain vector)
PotentialDifferenceMapPotential difference map
RandomMersenne Twister random number generator
RangeMapMap for storing values for integer keys from the range [0..size-1]
ReadMapReadable map concept
ReadWriteMapRead/writable map concept
ReferenceMapDereferable map concept
ScaleMapScales a map with a constant
ScaleWriteMapScales a map with a constant (read-write version)
SectionReaderSection reader class
SectionWriterSection writer class
ShiftMapShifts a map with a constant
ShiftWriteMapShifts a map with a constant (read-write version)
SimplePathA structure for representing directed paths in a digraph
SimplePath::ArcItIterator class to iterate on the arcs of the paths
SmartDigraphA smart directed graph class
SmartDigraph::SnapshotClass to make a snapshot of the digraph and to restrore to it later
SmartDigraphBaseBase of SmartDigraph
SmartGraphA smart undirected graph class
SmartGraph::SnapshotClass to make a snapshot of the digraph and to restrore to it later
SourceMapReturns the source of the given arc
SparseMapMap type based on std::map
StaticPathA structure for representing directed paths in a digraph
StaticPath::ArcItIterator class to iterate on the arcs of the paths
SubMapDifference of two maps
TargetMapReturns the target of the given arc
TimerClass for measuring the cpu time and real time usage of the process
TimeReportSame as Timer but prints a report on destruction
TimeStampA class to store (cpu)time instances
ToleranceA class to provide a basic way to handle the comparison of numbers that are obtained as a result of a probably inexact computation
Tolerance< double >Double specialization of Tolerance
Tolerance< float >Float specialization of Tolerance
Tolerance< long double >Long double specialization of Tolerance
TrueMapConstant true map
UnionFindA Union-Find data structure implementation
UnionFindEnumA Union-Find data structure implementation which is able to enumerate the components
UnionFindEnum::ClassItLEMON style iterator for the representant items
UnionFindEnum::ItemItLEMON style iterator for the items of a component
WriteMapWritable map concept
XMapMap of x-coordinates of a Point-map
YMapMap of y-coordinates of a Point-map

Generated on Tue May 5 07:41:37 2009 for LEMON by  doxygen 1.5.6