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
AllEdgeLookUpFast look up of all edges between given endpoints
AlterableBpUGraphComponentAn empty alteration notifier bipartite undirected graph class
AlterableGraphComponentAn empty alteration notifier graph class
AlterableUGraphComponentAn empty alteration notifier undirected graph class
AlterationNotifierNotifier class to notify observes about alterations in a container
AlterationNotifier::ImmediateDetachException which can be called from clear() and erase()
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
BaseBpUGraphComponentAn empty base bipartite undirected graph class
BaseBpUGraphComponent::ANodeHelper class for A-nodes
BaseBpUGraphComponent::BNodeHelper class for B-nodes
BaseGraphComponentAn empty base graph class
BaseUGraphComponentAn empty base undirected graph class
BaseUGraphComponent::UEdgeUndirected edge class of the graph
BellmanFordBellmanFord algorithm class
BellmanFord::ActiveItLemon iterator for get a active nodes
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
BiVariantSimple Variant type with two type
BoundingBoxA class to calculate or store the bounding box of plainvectors
BpUGraphClass describing the concept of Bipartite Undirected Graphs
BpUGraph::ANodeHelper class for ANodes
BpUGraph::ANodeItThis iterator goes through each ANode
BpUGraph::ANodeMapRead write map of the ANodes to type T
BpUGraph::BNodeHelper class for BNodes
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
BpUGraphAdaptorTrivial Bipartite Undirected Graph Adaptor
BpUGraphAdaptorBaseBase type for the Bipartite Undirected Graph Adaptors
BpUGraphAdaptorExtenderExtender for the BpUGraphAdaptors
BpUGraphExtenderExtender for the BpUGraphs
BucketHeapA Bucket Heap implementation
ClearableBpUGraphComponentAn empty clearable base bipartite undirected graph class
ClearableGraphComponentAn empty clearable base graph class
ClearableUGraphComponentAn empty clearable base undirected graph class
ColorData structure representing RGB colors
CombineMapCombines of two maps using an STL (binary) functor
CombinePoliciesCombinePolicies
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 column 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
DebugMapGraph map based on the std::vector storage
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::DefHeapNamed parameter for setting heap and cross reference type
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::DefStandardHeapNamed parameter for setting heap and cross reference type with automatic allocation
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
DirUGraphAdaptorA directed graph is made from an undirected graph by an adaptor
DirUGraphAdaptorBaseBase of direct undirected graph adaptor
DivMapQuotient of two maps
DynamicAsymMatrixMapDynamic Asymmetric Matrix Map
DynamicAsymMatrixMap::FirstKeyProxyProxy class for the first key type
DynamicAsymMatrixMap::SecondKeyProxyProxy class for the second key type
DynamicMatrixMapContainer for store values for each ordered pair of graph items
DynamicSymMatrixMapContainer for store values for each unordered pair of graph items
EdgeLookUpFast edge look up between given endpoints
EdgeReaderSectionReader for reading labeled edges
EdgeSetExtenderExtender for the EdgeSets
EdgeSetReaderSectionReader for reading a graph's edgeset
EdgeSetWriterSectionWriter for writing a graph's edgesets
EdgeSubGraphGraph which uses a subset of another graph's edges
EdgeSubGraphAdaptorAn adaptor for hiding edges from a graph
EdgeSubGraphBaseBase for the EdgeSubGraph
EdgeSubUGraphAdaptorAn adaptor for hiding undirected edges from an undirected graph
EdgeWriterSectionWriter for writing named edges
EdmondsKarpEdmonds-Karp algorithms class
EdmondsKarp::InvalidArgumentException for the case when the source equals the target
EntityBaseSkeleton of an entity class
EpsDrawerA simple tool to create .eps files
ErasableBpUGraphComponentAn empty erasable base bipartite undirected graph class
ErasableGraphComponentAn empty erasable graph class
ErasableUGraphComponentAn empty erasable base undirected graph class
ErasingFirstGraphAdaptorFor blocking flows
ErrorMessageException-safe convenient "error message" class
EulerItEuler iterator for directed graphs
ExceptionGeneric exception class
ExceptionMemberException safe wrapper class
ExtendableBpUGraphComponentAn empty extendable base undirected graph class
ExtendableGraphComponentAn empty extendable graph class
ExtendableUGraphComponentAn empty extendable base undirected graph class
FalseBasic type for defining "tags". A "NO" condition for enable_if
FibHeapFibonacci Heap
FileOpenError
FillBoolMapFill the true set 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
ForkWriteMapApplies 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
GraphThe directed graph concept
Graph::EdgeClass for identifying an edge of the graph
Graph::EdgeItThis iterator goes through each edge
Graph::EdgeMapRead write map of the edges to type T
Graph::InEdgeItThis iterator goes trough the incoming edges of a node
Graph::NodeClass for identifying a node of the graph
Graph::NodeItThis iterator goes through each node
Graph::NodeMapRead write map of the nodes to type T
Graph::OutEdgeItThis iterator goes trough the outgoing edges of a node
GraphAdaptorTrivial Graph Adaptor
GraphAdaptorBaseBase type for the Graph Adaptors
GraphAdaptorExtenderExtender for the GraphAdaptors
GraphCopyClass to copy a graph
GraphExtenderExtender for the Graphs
GraphIncItSkeleton class for graph InEdgeIt and OutEdgeIt
GraphItemSkeleton class for graph Node and Edge types
GraphItemItSkeleton 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
GridUGraphGrid graph class
GridUGraph::ColMapMap to get the column of the nodes
GridUGraph::IndexMapMap to get the indices of the nodes as dim2::Point<int>
GridUGraph::RowMapMap to get the row of the nodes
HaoOrlinHao-Orlin algorithm to find a minimum cut in directed graphs
HeapA concept structure describes the main interface of heaps
HeightPolicyHeightPolicy stops the search when a given height is reached or exceeds
HyperCubeGraphHyperCube graph class
HyperCubeGraph::HyperMapLinear combination map
IDableBpUGraphComponentAn empty idable base bipartite undirected graph class
IDableGraphComponentAn empty idable base graph class
IDableUGraphComponentAn empty idable base undirected 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
InvalidDummy type to make it easier to make invalid iterators
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
IterableBpUGraphComponentAn empty iterable bipartite undirected graph class
IterableGraphComponentAn empty iterable graph class
IterableIntMapDynamic iterable integer map
IterableIntMap::ItemItIterator for the keys with the same value
IterableIntMap::ReferenceRefernce to the value of the map
IterableUGraphComponentAn empty iterable undirected graph class
IterableValueMapDynamic iterable map for comparable values
IterableValueMap::ItemItIterator for the keys with the same value
IterableValueMap::ValueIteratorForward iterator for values
IterableWriterWriter for standard containers
IterationPolicyIterationPolicy limits the number of iterations and the number of iterations without improvement
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::DefStandardHeapNamed parameter for setting heap and cross reference type with automatic allocation
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
LineReaderReader for read the whole line
ListBpUGraphA smart bipartite undirected graph class
ListBpUGraph::SnapshotClass to make a snapshot of the graph and restore to it later
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 restore to it later
ListUEdgeSetGraph using a node set of another graph and an own uedge set
ListUGraphAn undirected list graph class
ListUGraph::SnapshotClass to make a snapshot of the graph and restore to it later
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
MapExtenderExtender for maps
MapFunctorConverts a map to an STL style (unary) functor
MapItIterator for maps with possibility of changing values
MappableBpUGraphComponentAn empty mappable base bipartite undirected graph class
MappableBpUGraphComponent::ANodeMapReadWrite map of the A-nodes
MappableBpUGraphComponent::BNodeMapReadWrite map of the B-nodes
MappableGraphComponentAn empty mappable graph class
MappableGraphComponent::EdgeMapReadWrite map of the edges
MappableGraphComponent::NodeMapReadWrite map of the nodes
MappableUGraphComponentAn empty mappable base bipartite undirected graph class
MappableUGraphComponent::UEdgeMapReadWrite map of the uedges
MatchingBpUGraphAdaptorBipartite graph adaptor to implement matching algorithms
MatrixColMapMap for the column view of the matrix
MatrixRowMapMap for the coloumn view of the matrix
MaxBipartiteMatchingBipartite Max Cardinality Matching algorithm
MaxCardinalitySearchMaximum Cardinality Search algorithm class
MaxCardinalitySearch::DefCardinalityMapNamed parameter for setting CardinalityMap type
MaxCardinalitySearch::DefHeapNamed parameter for setting heap and cross reference type
MaxCardinalitySearch::DefProcessedMapNamed parameter for setting ProcessedMap type
MaxCardinalitySearch::DefStandardHeapNamed parameter for setting heap and cross reference type with automatic allocation
MaxCardinalitySearch::UninitializedParameterException for uninitialized parameters
MaxCardinalitySearchDefaultTraitsDefault traits class of MaxCardinalitySearch class
MaxMatchingEdmonds' alternating forest maximum matching algorithm
MaxWeightedBipartiteMatchingBipartite Max Weighted Matching algorithm
MaxWeightedBipartiteMatching::DefHeapNamed parameter for setting heap and cross reference type
MaxWeightedBipartiteMatching::DefStandardHeapNamed parameter for setting heap and cross reference type with automatic allocation
MaxWeightedBipartiteMatching::UninitializedParameterException for uninitialized parameters
MinCostArborescenceMinCostArborescence algorithm class
MinCostArborescence::DefArborescenceMapNamed parameter for setting ArborescenceMap type
MinCostArborescence::DefPredMapNamed parameter for setting PredMap type
MinCostArborescence::DualItLemon iterator for get a dual variable
MinCostArborescence::UninitializedParameterException for uninitialized parameters
MinCostArborescenceDefaultTraitsDefault traits class of MinCostArborescence class
MinCostMaxBipartiteMatchingBipartite Min Cost Matching algorithm
MinCostMaxBipartiteMatching::DefHeapNamed parameter for setting heap and cross reference type
MinCostMaxBipartiteMatching::DefStandardHeapNamed parameter for setting heap and cross reference type with automatic allocation
MinCostMaxBipartiteMatching::UninitializedParameterException for uninitialized parameters
MinCostMaxBipartiteMatchingDefaultTraitsDefault traits class for minimum cost bipartite matching algoritms
MinCutCalculates the minimum cut in an undirected graph
MinCut::DefHeapNamed parameter for setting heap and cross reference type
MinCut::DefNeutralCapacityNamed parameter for setting the capacity type to constMap<UEdge, int, 1>()
MinCut::DefStandardHeapNamed parameter for setting heap and cross reference type with automatic allocation
MinCut::UninitializedParameterException for uninitialized parameters
MinCutDefaultTraitsDefault traits class of MinCut class
MipCplexInterface for the CPLEX MIP solver
MipGlpkInterface for the GLPK MIP solver
MipSolverBase
MulMapProduct of two maps
NegMapNegative value of a map
NegWriteMapNegative 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
NodeSubUGraphAdaptorAn adaptor for hiding nodes from an undirected graph
NodeWriterSectionWriter for writing named nodes
NonConstMapWrHelper class for calling kruskal with "constant" output map
NormSquareMapMap of the normSquare() of an Point-map
NoTimeReport'Do nothing' version of TimeReport
NotMapLogical 'not' of a map
NotWriteMapLogical 'not' of a map with writing possibility
NullMapNull map. (a.k.a. DoNothingMap)
OutDegMapMap of the node out-degrees
PairReaderReader for std::pair
PairWriterWriter for standard pairs
PaletteMap ints to different Colors
ParsedStringReaderReader for parsed string
PathA structure for representing directed paths in a graph
PathA skeleton structure for representing directed paths in a graph
Path::BuilderClass to build paths
Path::BuilderClass to build paths
Path::EdgeItIterator class to iterate on the edges of the paths
Path::EdgeItIterator class to iterate on the edges of the paths
Path::NodeItIterator class to iterate on the nodes of the paths
Path::NodeItIterator class to iterate on the nodes of the paths
PetStructStructure returned by addPetersen()
PointA simple two dimensional vector (plainvector) implementation
PolicyAndCombinationSome basic methode, how tow Policies can be combined
PolynomialSimple polinomial class
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::DefHeapNamed parameter for setting heap and cross reference type
Prim::DefPredMapNamed parameter for setting PredMap type
Prim::DefProcessedMapNamed parameter for setting ProcessedMap type
Prim::DefStandardHeapNamed parameter for setting heap and cross reference type with automatic allocation
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
QuotedCharReaderReader class for quoted strings
QuotedCharWriterWriter class for quoted chars
QuotedStringReaderReader class for quoted strings
QuotedStringWriterWriter class for quoted strings
RadixHeapA Radix Heap implementation
RandomMersenne Twister random number generator
RangeError
ReadMapReadable map concept
ReadMatrixMapReadable matrix map concept
ReadWriteMapRead/Writable map concept
ReadWriteMatrixMapRead/Writable map concept
ReferenceMapDereferable map concept
ReferenceMatrixMapDereferable matrix map concept
RefPtrReference counted pointer
ResGraphAdaptorAn adaptor for composing the residual graph for directed flow and circulation problems
ResGraphAdaptor::ResCapResidual capacity 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
ScaleWriteMapScales 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
ShiftWriteMapShift 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
SimpleBucketHeapA Simplified Bucket Heap implementation
SimpleControllerA simple controller for the simulated annealing class. This controller starts from a given initial temperature and evenly decreases it
SimpleMapSimple wrapping of the map
SimpleWriteMapSimple writeable wrapping of the map
SmartBpUGraphA smart bipartite undirected graph class
SmartBpUGraph::SnapshotClass to make a snapshot of the graph and to restrore to it later
SmartEdgeSetGraph using a node set of another graph and an own edge set
SmartGraphA smart graph class
SmartGraph::SnapshotClass to make a snapshot of the graph and to restrore to it later
SmartGraphBaseBase of SmartGraph
SmartUEdgeSetGraph using a node set of another graph and an own uedge set
SmartUGraphA smart undirected graph class
SmartUGraph::SnapshotClass to make a snapshot of the graph and to restrore to it later
SourceMapReturns the source of the given edge
SplitGraphAdaptorSplit graph adaptor class
SplitGraphAdaptor::CombinedEdgeMapEdgeMap combined from an original EdgeMap and NodeMap
SplitGraphAdaptor::CombinedNodeMapNodeMap combined from two original NodeMap
SplitGraphAdaptorBaseBase class for split graph adaptor
SspMinCostFlowImplementation of an algorithm for finding a flow of value k (for small values of k) having minimal total cost between two nodes
StdMapstd::map wrapper
StoreBoolMapWritable bool map for store each true assigned elements
SubGraphGraph which uses a subset of another graph's nodes and edges
SubGraphAdaptorA graph adaptor for hiding nodes and edges from a graph
SubGraphBaseBase for the SubGraph
SubMapDifference of two maps
SubMapExtenderExtender for maps which use a subset of the items
SubUGraphAdaptorA graph adaptor for hiding nodes and edges from an undirected graph
SuurballeImplementation of an algorithm for finding k edge-disjoint paths between 2 nodes of minimal total length
SwapBpUGraphAdaptorBipartite graph adaptor which swaps the two nodeset
TabuSearchTabuSearch main class
TabuSearch::BadParameterErrorThrown by setting the size of the tabu-set and the given size is less than 2
TabuSearchDefaultTraitsDefault Traits for TabuSearch class
TabuSearchPolicyConceptPolicy hierarchy to controll the search algorithm
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
TimePolicyTimePolicy limits the time for searching
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< unsigned int >Unsigned integer specialization of Tolerance
TrueBasic type for defining "tags". A "YES" condition for enable_if
UEdgeReaderSectionReader for reading labeled undirected edges
UEdgeSetExtenderExtender for the UEdgeSets
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
UGraphAdaptorTrivial undirected graph adaptor
UGraphAdaptorBaseBase type for the Graph Adaptors
UGraphAdaptorExtenderExtender for the UGraphAdaptors
UGraphCopyClass to copy an undirected graph
UGraphExtenderExtender for the UGraphs
UGraphReaderThe undirected graph reader class
UGraphWriterThe undirected graph writer class
UnderFlowPriorityErrorException thrown by RadixHeap
UndirGraphAdaptorAn undirected graph is made from a directed graph by an adaptor
UndirGraphAdaptor::CombinedEdgeMapEdgeMap combined from two original EdgeMap
UndirGraphExtenderBaseGraph to BaseUGraph extender
UnformattedReaderReader class for unformatted strings
UnformattedWriterWriter class for quoted strings
UninitializedParameterException for uninitialized parameters
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
UPetStructStructure returned by addUPetersen()
VectorMapGraph map based on the std::vector storage
VMapBaseBase class of the virtual maps
VReadMapMakes a virtual map from a ReadMap
VReadWriteMapMakes a virtual map from a ReadWriteMap
VRefMapBaseBase class of the virtual reference maps
VWriteMapMakes a virtual map from a WriteMap
WeightedBipartiteMatchingDefaultTraitsDefault traits class for weighted bipartite matching algoritms
WriteMapWritable map concept
WriteMatrixMapWritable map concept
XMapMap of x-coordinates of a dim2::Point<>-map
YMapMap of y-coordinates of a dim2::Point<>-map

Generated on Tue Oct 31 09:49:38 2006 for LEMON by  doxygen 1.5.1