LEMON Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
_FixId
AbsMapAbsolute value of a map
AddMapSum of two maps
AdvancedControllerA controller with preset running time for the simulated annealing class. With this controller you can set the running time of the annealing process in advance. It works the following way: the controller measures a kind of divergence. The divergence is the difference of the average cost of the recently found solutions the cost of the best found one. In case this divergence is greater than a given threshold, then we decrease the annealing factor, that is we cool the system faster. In case the divergence is lower than the threshold, then we increase the temperature. The threshold is a function of the elapsed time which reaches zero at the desired end time
AlterableGraphComponentAn empty alteration notifier base graph class
AlterableGraphExtenderClass to extend a graph with the functionality of alteration observing
AlterableUGraphExtenderClass to extend an undirected graph with the functionality of alteration observing
AlterationNotifierRegistry class to register objects observes alterations in the graph
AlterationNotifier::ObserverBaseObserverBase is the base class for the observers
ArrayMapGraph map based on the array storage
AssertionFailedError
AttributeReaderSectionReader for attributes
AttributeWriterSectionWriter for attributes
BackInserterBoolMapWritable bool map for store each true assigned elements in a back insertable container
BackwardMapReturns the "backward" directed edge view of an undirected edge
BaseErasableGraphComponentAn empty erasable base graph class
BaseExtendableGraphComponentAn empty extendable base graph class
BaseGraphComponentAn empty base graph class
BaseIterableGraphComponentAn empty iterable base graph class
BellmanFordBellmanFord algorithm class
BellmanFord::DefDistMapNamed parameter for setting DistMap type
BellmanFord::DefOperationTraitsNamed parameter for setting OperationTraits type
BellmanFord::DefPredMapNamed parameter for setting PredMap type Named parameter for setting PredMap type
BellmanFord::UninitializedParameterException for uninitialized parameters
BellmanFordDefaultOperationTraitsDefault OperationTraits for the BellmanFord algorithm class
BellmanFordDefaultTraitsDefault traits class of BellmanFord class
BellmanFordWizardA class to make the usage of BellmanFord algorithm easier
BellmanFordWizardBaseDefault traits used by BellmanFordWizard
BellmanFordWizardDefaultTraitsDefault traits class of BellmanFord function
BfsBFS algorithm class
Bfs::DefDistMapNamed parameter for setting DistMap type
Bfs::DefPredMapNamed parameter for setting PredMap type
Bfs::DefProcessedMapNamed parameter for setting ProcessedMap type
Bfs::DefProcessedMapToBeDefaultMapNamed parameter for setting the ProcessedMap type to be Graph::NodeMap<bool>
Bfs::DefReachedMapNamed parameter for setting ReachedMap type
Bfs::UninitializedParameterException for uninitialized parameters
BfsDefaultTraitsDefault traits class of Bfs class
BfsWizardA class to make the usage of Bfs algorithm easier
BfsWizardBaseDefault traits used by BfsWizard
BfsWizardDefaultTraitsDefault traits class of Bfs function
BinHeapA Binary Heap implementation
BoundingBoxA class to calculate or store the bounding box of plainvectors
BpUGraphClass describing the concept of Bipartite Undirected Graphs
BpUGraph::ANodeThe base type of anode iterators, or in other words, the trivial anode iterator
BpUGraph::ANodeItThis iterator goes through each ANode
BpUGraph::ANodeMapRead write map of the ANodes to type T
BpUGraph::BNodeThe base type of bnode iterators, or in other words, the trivial bnode iterator
BpUGraph::BNodeItThis iterator goes through each BNode
BpUGraph::BNodeMapRead write map of the BNodes to type T
BpUGraph::EdgeThe directed edge type
BpUGraph::EdgeItThis iterator goes through each directed edge
BpUGraph::EdgeMapRead write map of the directed edges to type T
BpUGraph::IncEdgeItThis iterator goes trough the incident undirected edges of a node
BpUGraph::InEdgeItThis iterator goes trough the incoming directed edges of a node
BpUGraph::NodeThe base type of node iterators, or in other words, the trivial node iterator
BpUGraph::NodeItThis iterator goes through each node
BpUGraph::NodeMapRead write map of the nodes to type T
BpUGraph::OutEdgeItThis iterator goes trough the outgoing directed edges of a node
BpUGraph::UEdgeThe base type of the undirected edge iterators
BpUGraph::UEdgeItThis iterator goes through each undirected edge
BpUGraph::UEdgeMapRead write map of the undirected edges to type T
ClearableGraphComponentAn empty clearable base graph class
ColorData structure representing RGB colors
ColorSetMaps ints to different Colors
CombineMapCombines of two maps using an STL (binary) functor
ComposeMapComposition of two maps
ConEdgeItIterator for iterating on edges connected the same nodes
ConstMapConstant map
ConstMapItIterator for maps with possibility of getting values
ConstMatrixColMapMap for the col view of the matrix
ConstMatrixRowMapMap for the row view of the matrix
ConstXMapConstant (read only) version of XMap
ConstYMapConstant (read only) version of YMap
ContentReaderSectionReader for retrieve what is in the file
ControllerBaseA base class for controllers
ConUEdgeItIterator for iterating on uedges connected the same nodes
ConvertMapConvert the Value of a map to another type
CounterA counter class
DagLongestPathOperationTraitsInverse OperationTraits for the DagShortestPath algorithm class
DagLongestPathTraitsInverse traits class of DagShortestPath class
DagShortestPathDagShortestPath algorithm class
DagShortestPath::DefDistMapNamed parameter for setting DistMap type
DagShortestPath::DefOperationTraitsNamed parameter for setting OperationTraits type
DagShortestPath::DefPredMapNamed parameter for setting PredMap type Named parameter for setting PredMap type
DagShortestPath::UninitializedParameterException for uninitialized parameters
DagShortestPathDefaultOperationTraitsDefault OperationTraits for the DagShortestPath algorithm class
DagShortestPathDefaultTraitsDefault traits class of DagShortestPath class
DagShortestPathWizardA class to make the usage of DagShortestPath algorithm easier
DagShortestPathWizardBaseDefault traits used by DagShortestPathWizard
DagShortestPathWizardDefaultTraitsDefault traits class of DagShortestPath function
DataFormatError
DefaultGraphToEpsTraitsDefault traits class of GraphToEps
DefaultMap
DefaultReaderThe default item reader template class
DefaultReaderTraitsStandard ReaderTraits for the GraphReader class
DefaultSkipperThe default item reader for skipping a value in the stream
DefaultWriterThe default item writer template class
DefaultWriterTraitsStandard WriterTraits for the section writers
DescriptorMapProvides a mutable, continuous and unique descriptor for each item in the graph
DescriptorMap::InverseMapThe inverse map type of DescriptorMap
DfsDFS algorithm class
Dfs::DefDistMapNamed parameter for setting DistMap type
Dfs::DefPredMapNamed parameter for setting PredMap type
Dfs::DefProcessedMapNamed parameter for setting ProcessedMap type
Dfs::DefProcessedMapToBeDefaultMapNamed parameter for setting the ProcessedMap type to be Graph::NodeMap<bool>
Dfs::DefReachedMapNamed parameter for setting ReachedMap type
Dfs::UninitializedParameterException for uninitialized parameters
DfsDefaultTraitsDefault traits class of Dfs class
DfsVisitDFS Visit algorithm class
DfsVisit::DefReachedMapNamed parameter for setting ReachedMap type
DfsVisit::UninitializedParameterException for uninitialized parameters
DfsVisitDefaultTraitsDefault traits class of DfsVisit class
DfsVisitorVisitor class for dfs
DfsWizardA class to make the usage of the Dfs algorithm easier
DfsWizardBaseDefault traits used by DfsWizard
DfsWizardDefaultTraitsDefault traits class of Dfs function
DijkstraDijkstra algorithm class
Dijkstra::DefDistMapNamed parameter for setting DistMap type
Dijkstra::DefHeap
Dijkstra::DefPredMapNamed parameter for setting PredMap type
Dijkstra::DefProcessedMapNamed parameter for setting ProcessedMap type
Dijkstra::DefProcessedMapToBeDefaultMapNamed parameter for setting the ProcessedMap type to be Graph::NodeMap<bool>
Dijkstra::DefStandardHeap
Dijkstra::UninitializedParameterException for uninitialized parameters
DijkstraDefaultTraitsDefault traits class of Dijkstra class
DijkstraWizardA class to make the usage of Dijkstra algorithm easier
DijkstraWizardBaseDefault traits used by DijkstraWizard
DijkstraWizardDefaultTraitsDefault traits class of Dijkstra function
DirPathA structure for representing directed paths in a graph
DirPath::BuilderClass to build paths
DirPath::EdgeItIterator class to iterate on the edges of the paths
DirPath::NodeItIterator class to iterate on the nodes of the paths
DivMapQuotient of two maps
DynamicMatrixMapContainer for store values for each ordered pair of graph items
DynamicSymMatrixMapContainer for store values for each unordered pair of graph items
EdgeReaderSectionReader for reading labeled edges
EdgeSetReaderSectionReader for reading a graph's edgeset
EdgeSetWriterSectionWriter for writing a graph's edgesets
EdgeSubGraphGraph which uses a subset of an other graph's edges
EdgeSubGraphAdaptorAn adaptor for hiding edges from a graph
EdgeSubGraphBaseBase for the EdgeSubGraph
EdgeWriterSectionWriter for writing named edges
EntityBaseSkeleton of an entity class
ErasableBpUGraphAn empty erasable undirected graph class
ErasableGraphAn empty erasable graph class
ErasableGraphComponentAn empty erasable extended graph class
ErasableUGraphAn empty erasable undirected graph class
ErasingFirstGraphAdaptor
ErrorMessageException-safe convenient "error message" class
EulerItEuler iterator for directed graphs
ExceptionGeneric exception class
ExceptionMemberException safe wrapper class
ExtendableBpUGraphAn empty non-static undirected graph class
ExtendableGraphAn empty non-static graph class
ExtendableGraphComponentAn empty extendable extended graph class
ExtendableUGraphAn empty non-static undirected graph class
FalseBasic type for defining "tags". A "NO" condition for enable_if
FibHeapFibonacci Heap
FileOpenError
FillBoolMapFill the true setted elements with a given value
FilterMapItIterator for maps which filters items by the values
FloydWarshallFloydWarshall algorithm class
FloydWarshall::DefDistMapNamed parameter for setting DistMap type
FloydWarshall::DefOperationTraitsNamed parameter for setting OperationTraits type
FloydWarshall::DefPredMapNamed parameter for setting PredMap type Named parameter for setting PredMap type
FloydWarshall::UninitializedParameterException for uninitialized parameters
FloydWarshallDefaultOperationTraitsDefault OperationTraits for the FloydWarshall algorithm class
FloydWarshallDefaultTraitsDefault traits class of FloydWarshall class
ForkMapApplies all map setting operations to two maps
ForwardMapReturns the "forward" directed edge view of an undirected edge
FredmanTarjanFredmanTarjan algorithm class to find a minimum spanning tree
FredmanTarjan::DefTreeMapNamed parameter for setting TreeMap
FredmanTarjan::UninitializedParameterException for uninitialized parameters
FredmanTarjanDefaultTraitsDefault traits class of FredmanTarjan class
FrontInserterBoolMapWritable bool map for store each true assigned elements in a front insertable container
FullBpUGraphAn undirected full bipartite graph class
FullGraphA full graph class
FullUGraphAn undirected full graph class
FunctorMapConverts an STL style functor to a map
GraphAdaptorBaseBase type for the Graph Adaptors

Base type for the Graph Adaptors

GraphCopyClass to copy a graph
GraphIncIteratorSkeleton class for graph InEdgeIt and OutEdgeIt
GraphItemSkeleton class for graph Node and Edge types
GraphIteratorSkeleton class for graph NodeIt and EdgeIt
GraphMapClass describing the concept of graph maps
GraphReaderThe graph reader class
GraphToEpsHelper class to implement the named parameters of graphToEps()
GraphWriterThe graph writer class
GridGraphGrid graph class
GridGraph::ColMapMap to get the column of the nodes
GridGraph::IndexMapMap to get the indices of the nodes as xy<int>
GridGraph::RowMapMap to get the row of the nodes
GridGraphBaseBase graph for GridGraph
HeapA concept structure describes the main interface of heaps
HyperCubeGraphHyperCube graph class
HyperCubeGraph::HyperMapLinear combination map
HyperCubeGraphBaseBase graph for HyperCubeGraph
IDableGraphComponentAn empty idable base graph class
IdentityMapIdentity mapping
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
InserterBoolMapWritable bool map for store each true assigned elements in an insertable container
InsertReaderReader for standard containers
InvalidSee INVALID, how to use it
InvertableMapGeneral invertable graph-map type
InvertableMap::InverseMapThe inverse map type
InvertableMap::ValueIteratorForward iterator for values
IOError
IterableBoolMapDynamic iterable bool map
IterableBoolMap::FalseItIterator for the keys mapped to false
IterableBoolMap::ItemItIterator for the keys mapped to a given value
IterableBoolMap::ReferenceRefernce to the value of the map
IterableBoolMap::TrueItIterator for the keys mapped to true
IterableGraphComponentAn empty iterable base graph class
IterableIntMapDynamic iterable integer map
IterableIntMap::ItemItIterator for the keys with the same value
IterableIntMap::ReferenceRefernce to the value of the map
IterableValueMapDynamic iterable map for comparable values
IterableValueMap::ItemItIterator for the keys with the same value
IterableValueMap::ValueIteratorForward iterator for values
IterableWriterWriter for standard containers
JohnsonJohnson algorithm class
Johnson::DefDistMapNamed parameter for setting DistMap type
Johnson::DefHeapNamed parameter for setting heap and cross reference type
Johnson::DefOperationTraitsNamed parameter for setting OperationTraits type
Johnson::DefPredMapNamed parameter for setting PredMap type Named parameter for setting PredMap type
Johnson::DefStandardHeap
Johnson::UninitializedParameterException for uninitialized parameters
JohnsonDefaultOperationTraitsDefault OperationTraits for the Johnson algorithm class
JohnsonDefaultTraitsDefault traits class of Johnson class
KruskalMapInputKruskal's input source
KruskalSequenceOutputA writable bool-map that makes a sequence of "true" keys
LemonReaderLemon Format reader class
LemonReader::SectionReaderAbstract base class for reading a section
LemonWriterLemon Format writer class
LemonWriter::SectionWriterAbstract base class for writing a section
LinearHeapA Linear Heap implementation
LineReaderReader for read the whole line
ListEdgeSetGraph using a node set of another graph and an own edge set
ListGraphA list graph class
ListGraph::SnapshotClass to make a snapshot of the graph and to restrore to it later
ListUEdgeSetGraph using a node set of another graph and an own uedge set
ListUGraphAn undirected list graph class
LogicErrorOne of the two main subclasses of Exception
LpCplexInterface for the CPLEX solver
LpGlpkInterface for the GLPK LP solver
LpSkeletonA skeleton class to implement LP solver interfaces
LpSolverBaseCommon base class for LP solvers
LpSolverBase::ColRefer to a column of the LP
LpSolverBase::ConstrLinear constraint
LpSolverBase::DualExprLinear expression of rows
LpSolverBase::ExprLinear expression of variables and a constant component
LpSolverBase::RowRefer to a row of the LP
MapBaseBase class of maps
MapFunctorConverts a map to an STL style (unary) functor
MapItIterator for maps with possibility of changing values
MappableEdgeSetExtender
MappableGraphComponentAn empty mappable base graph class
MappableGraphComponent::EdgeMapReadWrite map of the edges
MappableGraphComponent::NodeMapReadWrite map of the nodes
MappableGraphExtender
MappableUEdgeSetExtender
MappableUGraphExtender
MatrixColMapMap for the row view of the matrix
MatrixRowMapMap for the coloumn view of the matrix
MaxIDableGraphComponentAn empty max-idable base graph class
MaxMatchingEdmonds' alternating forest maximum matching algorithm
MinCostFlowImplementation of an algorithm for finding a flow of value k (for small values of k) having minimal total cost between 2 nodes
MulMapProduct of two maps
NegMapNegative value of a map
NoCounter'Do nothing' version of Counter
NodeReaderSectionReader for reading labeled nodes
NodeSetReaderSectionReader for reading a graph's nodeset
NodeSetWriterSectionWriter for writing a graph's nodeset
NodeSubGraphAdaptorAn adaptor for hiding nodes from a graph
NodeWriterSectionWriter for writing named nodes
NonConstMapWrHelper class for calling kruskal with "constant" output map
NormSquareMapMap of the normSquare() of an xy-map
NoTimeReport'Do nothing' version of TimeReport
NotMapLogical 'not' of a map
NullMapNull map. (a.k.a. DoNothingMap)
OutDegMapMap of the node out-degrees
PairReaderReader for std::pair
PairWriterWriter for standard pairs
ParsedStringReaderReader for parsed string
PathA skeleton structure for representing directed paths in a graph
Path::BuilderClass to build paths
Path::EdgeItIterator class to iterate on the edges of the paths
Path::NodeItIterator class to iterate on the nodes of the paths
PetStructStructure returned by addPetersen()
PotentialDifferenceMapPotential difference map
PreflowPreflow algorithms class
Preflow::InvalidArgumentException for the case when the source equals the target
PrimPrim algorithm class to find a minimum spanning tree
Prim::DefHeap
Prim::DefPredMapNamed parameter for setting PredMap type
Prim::DefProcessedMapNamed parameter for setting ProcessedMap type
Prim::DefStandardHeap
Prim::DefTreeMapNamed parameter for setting TreeMap
Prim::UninitializedParameterException for uninitialized parameters
PrimDefaultTraitsDefault traits class of Prim class
PushBackReaderReader for standard containers
QuotedCharArrayWriterWriter class for quoted char array
QuotedStringReaderReader class for quoted strings
QuotedStringWriterWriter class for quoted strings
RadixHeapA Radix Heap implementation
RangeError
ReadMapReadable map concept
ReadMatrixMapReadable matrix map concept
ReadWriteMapRead/Writable map concept
ReadWriteMatrixMapRead/Writable map concept
ReferenceMapDereferable map concept
ReferenceMatrixMapDereferable matrix map concept
ResGraphAdaptor
ResGraphAdaptor::ResCapAs a map
RevGraphAdaptorA graph adaptor which reverses the orientation of the edges
RuntimeErrorOne of the two main subclasses of Exception
ScaleMapScales a maps with a constant
SettingOrderBoolMapWritable bool map which stores for each true assigned elements the setting order number
ShiftMapShift a map with a constant
SimAnnSimulated annealing class
SimAnnBaseSimulated annealing abstract base class. Can be used to derive a custom simulated annealing class if SimAnn doesn't fit your needs
SimpleControllerA simple controller for the simulated annealing class. This controller starts from a given initial temperature and evenly decreases it
SmartBpUGraphA smart bipartite undirected graph class
SmartGraphA smart graph class
SmartGraph::SnapshotClass to make a snapshot of the graph and to restrore to it later
SmartGraphBaseBase of SmartGraph
SmartUGraphA smart undirected graph class
SourceMapReturns the source of the given edge
SplitGraphAdaptorBase::Edge
StaticGraphAn empty static graph class
StaticGraph::EdgeThe base type of the edge iterators
StaticGraph::EdgeItThis iterator goes through each edge
StaticGraph::EdgeMapRead write map of the edges to type T
StaticGraph::InEdgeItThis iterator goes trough the incoming edges of a node
StaticGraph::NodeCopy consructor
StaticGraph::NodeItThis iterator goes through each node
StaticGraph::NodeMapRead write map of the nodes to type T
StaticGraph::OutEdgeItThis iterator goes trough the outgoing edges of a node
StaticMapGraph map with static sized storage
StaticMap::UnsinportedOperationException class for unsinported exceptions
StaticMappableGraphExtender
StaticMappableUGraphExtender
StdMapstd::map wrapper
StoreBoolMapWritable bool map for store each true assigned elements
SubBidirGraphAdaptorBase::EdgeMap
SubGraphGraph which uses a subset of an other graph's nodes and edges
SubGraphAdaptorA graph adaptor for hiding nodes and edges from a graph
SubGraphBaseBase for the SubGraph
SubMapDifference of two maps
SuurballeImplementation of an algorithm for finding k edge-disjoint paths between 2 nodes of minimal total length
TargetMapReturns the target of the given edge
TightEdgeFilterMapA map for filtering the edge-set to those edges which are tight w.r.t. a node-potential and edge-distance
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< int >Integer specialization of Tolerance
Tolerance< long double >Long double specialization of Tolerance
Tolerance< long long int >Long long integer specialization of Tolerance
TrueBasic type for defining "tags". A "YES" condition for enable_if
UEdgeReaderSectionReader for reading labeled undirected edges
UEdgeSetReaderSectionReader for reading a undirected graph's edgeset
UEdgeSetWriterSectionWriter for writing a undirected edgeset
UEdgeWriterSectionWriter for writing named undirected edges
UEulerItEuler iterator for undirected graphs
UGraphClass describing the concept of Undirected Graphs
UGraph::EdgeThe directed edge type
UGraph::EdgeItThis iterator goes through each directed edge
UGraph::EdgeMapRead write map of the directed edges to type T
UGraph::IncEdgeItThis iterator goes trough the incident undirected edges of a node
UGraph::InEdgeItThis iterator goes trough the incoming directed edges of a node
UGraph::NodeThe base type of node iterators, or in other words, the trivial node iterator
UGraph::NodeItThis iterator goes through each node
UGraph::NodeMapRead write map of the nodes to type T
UGraph::OutEdgeItThis iterator goes trough the outgoing directed edges of a node
UGraph::UEdgeThe base type of the undirected edge iterators
UGraph::UEdgeItThis iterator goes through each undirected edge
UGraph::UEdgeMapRead write map of the undirected edges to type T
UGraphAdaptorAn undirected graph is made from a directed graph by an adaptor

Undocumented, untested!!! If somebody knows nice demo application, let's polulate it

UGraphCopyClass to copy an undirected graph
UGraphReaderThe undirected graph reader class
UGraphWriterThe undirected graph writer class
UnderFlowPriorityErrorException thrown by RadixHeap
UninitializedParameterException for uninitialized parameters
UnionFindA Union-Find data structure implementation
UnionFindEnumA Union-Find data structure implementation which is able to enumerate the components
UPathA structure for representing undirected path in a graph
UPath::BuilderClass to build paths
UPath::EdgeItIterator class to iterate on the edges of the paths
UPath::NodeItIterator class to iterate on the nodes of the paths
UPetStructStructure returned by addUPetersen()
VectorMapGraph map based on the std::vector storage
WriteMapWritable map concept
WriteMatrixMapWritable map concept
XMapMap of x-coordinates of an xy<>-map
xyA simple two dimensional vector (plainvector) implementation
YMapMap of y-coordinates of an xy<>-map

Generated on Fri Feb 3 18:39:56 2006 for LEMON by  doxygen 1.4.6