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 builded erasable graph class
_ExtendableGraphModular builded extendable graph class
_StaticGraphModular builded static graph class
AbsMapAbsolute value of a map
AddMapSum of two maps
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
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
BidirGraphWrapperA wrapper 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
ComposeMapComposition of two maps
ConstMapConstant map
DataFormatError
DefaultGraphToEpsTraitsDefault traits class of GraphToEps
DefaultMapSelector
DefaultReaderTraitsStandard ReaderTraits for the GraphReader class
DefaultReaderTraits::ReaderTemplate class for reading an value
DefaultWriterTraitsStandard WriterTraits for the GraphWriter class
DefaultWriterTraits::WriterTemplate class for writing an value
DescriptorMapProvides a mutable, continous and unique descriptor for each item in the graph
DfsDFS algorithm class
DijkstraDijkstra algorithm class
Dijkstra::DefDistMapNamed parameter for setting DistMap type
Dijkstra::DefPredMapNamed parameter for setting PredMap type
Dijkstra::DefPredNodeMapNamed parameter for setting PredNodeMap type
Dijkstra::DefReachedMapNamed parameter for setting ReachedMap type
Dijkstra::DefReachedMapToBeDefaultMapNamed parameter for setting the ReachedMap type to be Graph::NodeMap<bool>
Dijkstra::UninitializedParameterException for uninitialized parameters
DijkstraDefaultTraitsDefault traits class of Dijkstra class
DijkstraWizardA class to make easier the usage of Dijkstra algorithm
DijkstraWizardBaseDefault traits used by DijkstraWizard
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
EdgeSubGraphWrapperA wrapper for hiding edges from a graph
ErasableGraphAn empty erasable graph class
ErasableGraphComponentAn empty erasable extended graph class
ErasableSymGraphAn empty erasable graph class
ErasingFirstGraphWrapperFor blocking flows
ErrorMessageException-safe convenient "error message" class
ExceptionGeneric exception class
ExtendableGraphAn empty non-static graph class
ExtendableGraphComponentAn empty extendable extended graph class
ExtendableSymGraphAn empty non-static graph class
FalseBasic type for defining "tags". A "NO" condidion for enable_if
FibHeapFibonacci Heap
FullGraphA full graph class
FunctorMapConverts an STL style functor to a a map
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
IDableGraphComponentAn empty idable base graph class
IdMapProvides an immutable and unique id for each item in the graph
IdMap::InverseMapThe class represents the inverse of the map
InvalidSee INVALID, how to use it
InversableMapGeneral inversable map type
IOError
IterableGraphComponentAn empty iterable base graph class
KruskalMapInputKruskal input source
KruskalSequenceOutputA writable bool-map that makes a sequence of "true" keys
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
MapBaseBase class of maps
MapConstIterator
MapConstIterator::PairPointerThe pointer type of the iterator
MapConstKeySet
MapConstValueIterator
MapConstValueSet
MapFunctorConverts a map to an STL style functor
MapIterator
MapIterator::PairPointerThe pointer type of the iterator
MapIteratorBase
MapKeyIterator
MappableGraphComponentAn empty mappable base graph class
MappableGraphComponent::EdgeMapReadWrite map of the edges
MappableGraphComponent::NodeMapReadWrite map of the nodes
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
NodeSubGraphWrapperA wrapper for hiding nodes from a graph
NonConstMapWrHelper class for calling kruskal with "constant" output map
NullMapNull map. (a.k.a. DoNothingMap)
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
QuotedStringReaderReader class for quoted strings
QuotedStringWriterWriter class for quoted strings
RangeError
ReadMapReadable map concept
ReadWriteMapRead/Writable map concept
ReferenceMapDereferable map concept
ResGraphWrapperA wrapper for composing the residual graph for directed flow and circulation problems
ResGraphWrapper::ResCapResidual capacity map
RevGraphWrapperA graph wrapper which reverses the orientation of the edges
RuntimeErrorOne of the two main subclasses of Exception
ScaleMapScale a maps with a constant
ShiftMapShift a maps with a constant
SmartGraphA smart graph class
SmartGraph::SnapShotClass to make a snapshot of the graph and to restrore to it later
SmartGraphBaseBase of SmartGraph
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
StaticSymGraphAn empty static graph class
StaticSymGraph::EdgeThe base type of the edge iterators
StaticSymGraph::EdgeItThis iterator goes through each edge
StaticSymGraph::EdgeMapReference map of the edges to type T
StaticSymGraph::InEdgeItThis iterator goes trough the incoming edges of a node
StaticSymGraph::NodeCopy consructor
StaticSymGraph::NodeItThis iterator goes through each node
StaticSymGraph::NodeMap
StaticSymGraph::OutEdgeItThis iterator goes trough the outgoing edges of a node
StaticSymGraph::SymEdgeThe base type of the symmetric edge iterators
StaticSymGraph::SymEdgeItThis iterator goes through each symmetric edge
StaticSymGraph::SymEdgeMapReference map of the edges to type T
StdMapstd::map wrapper
SubBidirGraphWrapperA wrapper for composing a subgraph of a bidirected graph made from a directed one
SubBidirGraphWrapperBase::Edge
SubBidirGraphWrapperBase::EdgeMap
SubGraphWrapperA graph wrapper 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()
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" condidion for enable_if
UndirGraphClass describing the concept of Undirected Graphs
UndirGraphEdge
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
xyA two dimensional vector (plainvector) implementation

Generated on Mon Feb 21 15:02:28 2005 for LEMON by  doxygen 1.4.1