Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

LEMON Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
_ErasableGraphModular erasable graph class
_ExtendableGraphModular extendable graph class
_FixId
_StaticGraphModular static graph class
AbsMapAbsolute value of a map
AddMapSum of two maps
AdvancedControllerA controller with preset running time for the simulated annealing class
AlterableGraphComponentAn empty alteration notifier base graph class
AlterableGraphExtenderClass to extend a graph with the functionality of alteration observing
AlterableUndirGraphExtenderClass 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
ArrayMap
AssertionFailedError
AttributeReaderSectionReader for attributes
AttributeWriterSectionWriter for attributes
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
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
BidirGraphAdaptorAn adaptor for composing bidirected graph from a directed one
BinHeapA Binary Heap implementation
BoundingBoxA class to calculate or store the bounding box of plainvectors
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
CommonSectionReaderBaseHelper class for implementing the common SectionReaders
CommonSectionWriterBaseHelper class for implementing the common SectionWriters
ComposeMapComposition of two maps
ConEdgeItIterator for iterating on edges connected the same nodes
ConstMapConstant map
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
ConvertMapConvert the Value of a map to another type
DataFormatError
DefaultGraphToEpsTraitsDefault traits class of GraphToEps
DefaultMapSelector
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
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::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::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
EdgeReaderSectionReader for reading labeled edges
EdgeSetReaderSectionReader for reading a graph's edgeset
EdgeSetWriterSectionWriter for writing a graph's edgesets
EdgeSubGraphAdaptorAn adaptor for hiding edges from a graph
EdgeWriterSectionWriter for writing labeled edges
EntityBaseSkeleton of an entity class
ErasableGraphAn empty erasable graph class
ErasableGraphComponentAn empty erasable extended graph class
ErasableUndirGraphAn empty erasable undirected graph class
ErasingFirstGraphAdaptorFor blocking flows
ErrorMessageException-safe convenient "error message" class
ExceptionGeneric exception class
ExceptionMemberException safe wrapper class
ExtendableGraphAn empty non-static graph class
ExtendableGraphComponentAn empty extendable extended graph class
ExtendableUndirGraphAn empty non-static undirected graph class
extended_pairA more customizable pair type than std::pair
FalseBasic type for defining "tags". A "NO" condition for enable_if
FibHeapFibonacci Heap
ForkMapApplies all map setting operations to two maps
ForwardMapReturns the "forward" directed edge view of an undirected edge
FullGraphA full graph class
FunctorMapConverts an STL style functor to a map
GraphAdaptorBase
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
HeapA concept structure describes the main interface of heaps
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
InsertReaderReader for standard containers
InvalidSee INVALID, how to use it
InvertableMapGeneral invertable graph-map type
InvertableMap::InverseMapThe inverse map type
IOError
IterableGraphComponentAn empty iterable base graph class
IterableWriterWriter for standard containers
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
ListGraphA list graph class
ListGraph::SnapShotClass to make a snapshot of the graph and to restrore 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
MapConstIterator
MapConstIterator::PointerThe pointer type of the iterator
MapConstKeyIterator
MapConstKeySet
MapConstValueIterator
MapConstValueSet
MapFunctorConverts a map to an STL style (unary) functor
MapIterator
MapIterator::PointerThe pointer type of the iterator
MapIteratorBase
MappableGraphComponentAn empty mappable base graph class
MappableGraphComponent::EdgeMapReadWrite map of the edges
MappableGraphComponent::NodeMapReadWrite map of the nodes
MapSet
MapValueIterator
MapValueSet
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
NewEdgeSetAdaptorGraph adaptor using a node set of another graph and an own edge set
NewUndirEdgeSetAdaptorGraph adaptor using a node set of another graph and an own undir edge set
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 labeled nodes
NonConstMapWrHelper class for calling kruskal with "constant" output map
NormSquareMapMap of the normSquare() of an xy-map
NotMapLogical 'not' of a map
NullMapNull map. (a.k.a. DoNothingMap)
OutDegMapMap of the node out-degrees
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()
PreflowPreflow algorithms 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
ReadWriteMapRead/Writable map concept
ReferenceMapDereferable map concept
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
ShiftMapShift a map with a constant
SimAnnSimulated annealing class
SimAnnBaseSimulated annealing base class
SimpleControllerA simple controller for the simulated annealing class
SmartGraphA smart graph class
SmartGraph::SnapShotClass to make a snapshot of the graph and to restrore to it later
SmartGraphBaseBase of SmartGraph
SourceMapReturns the source of the given 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
StdMapstd::map wrapper
SubBidirGraphAdaptorAn adaptor for composing a subgraph of a bidirected graph made from a directed one
SubBidirGraphAdaptorBase::Edge
SubBidirGraphAdaptorBase::EdgeMap
SubGraphAdaptorA graph adaptor for hiding nodes and edges from a graph
SubMapDifference of two maps
SuurballeImplementation of an algorithm for finding k edge-disjoint paths between 2 nodes of minimal total length
SymPetStructStructure returned by addSymPetersen()
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 measuring the cpu time and real time usage of the process
TimeStampA class to store (cpu)time instances
TrueBasic type for defining "tags". A "YES" condition for enable_if
UnderFlowPriorityErrorException thrown by RadixHeap
UndirEdgeReaderSectionReader for reading labeled undirected edges
UndirEdgeSetReaderSectionReader for reading a undirected graph's edgeset
UndirEdgeSetWriterSectionWriter for writing a undirected edgeset
UndirEdgeWriterSectionWriter for writing labeled undirected edges
UndirFullGraphAn undirected full graph class
UndirGraphClass describing the concept of Undirected Graphs
UndirGraph::EdgeThe directed edge type
UndirGraph::EdgeItThis iterator goes through each directed edge
UndirGraph::EdgeMapRead write map of the directed edges to type T
UndirGraph::IncEdgeItThis iterator goes trough the incident undirected edges of a node
UndirGraph::InEdgeItThis iterator goes trough the incoming directed edges of a node
UndirGraph::Node
UndirGraph::NodeItThis iterator goes through each node
UndirGraph::NodeMapRead write map of the nodes to type T
UndirGraph::OutEdgeItThis iterator goes trough the outgoing directed edges of a node
UndirGraph::UndirEdgeThe base type of the undirected edge iterators
UndirGraph::UndirEdgeItThis iterator goes through each undirected edge
UndirGraph::UndirEdgeMapRead write map of the undirected edges to type T
UndirGraphAdaptorAn undirected graph is made from a directed graph by an adaptor
UndirGraphAdaptorBase::EdgeMap
UndirGraphReaderThe undir graph reader class
UndirGraphWriterThe undirected graph writer class
UndirListGraphAn undirected list graph class
UndirPathA structure for representing undirected path in a graph
UndirPath::BuilderClass to build paths
UndirPath::EdgeItIterator class to iterate on the edges of the paths
UndirPath::NodeItIterator class to iterate on the nodes of the paths
UndirSmartGraphA smart undirected graph class
UninitializedParameterException for uninitialized parameters
UnionFindA Union-Find data structure implementation
UnionFindEnumA Union-Find data structure implementation which is able to enumerate the components
VectorMap
WriteMapWritable 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 Sat Aug 27 14:14:55 2005 for LEMON by  doxygen 1.4.4