LEMON Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
ArrayMap
BfsBFS algorithm class
BidirGraphA bidirected graph template
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
ConstMapConstant map
DfsDFS algorithm class
DijkstraDijkstra algorithm class
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
EdgeSetGraph structure using a node set of another graph
ErasableGraphAn empty erasable graph class
ErasingFirstGraphWrapperFor blocking flows
ExtendableGraphAn empty non-static graph class
FibHeapFibonacci Heap
FullGraphA full graph class
GraphWrapperBase type for the Graph Wrappers
InvalidSee INVALID, how to use it
KeyInfoHelper class to get information about the key type
KruskalMapInputKruskal input source
KruskalSequenceOutputA writable bool-map that makes a sequence of "true" keys
ListGraphA list graph class
MapBaseBase class of maps
MapConstIterator
MapConstIterator::PairPointerTypeThe pointer type of the iterator
MapConstKeySet
MapConstValueIterator
MapConstValueSet
MapIterator
MapIterator::PairPointerTypeThe pointer type of the iterator
MapIteratorBase
MapKeyIterator
MapRegistry
MapRegistry::MapBase
MapRegistry::MapBase::NotSupportedOperationException
MapValueIterator
MapValueSet
MinCostFlowImplementation of an algorithm for finding a flow of value k (for small values of k) having minimal total cost between 2 nodes
NodeSetA graph class containing only nodes
NodeSet::EdgeMapCreating empty map structure for edges
NonConstMapWrHelper class for calling kruskal with "constant" output map
NullMapNull map. (a.k.a. DoNothingMap)
PathA skeletom 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
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
SmartGraphA smart graph class
StaticGraphAn empty static graph class
StaticGraph::EdgeThe base type of the edge iterators
StaticGraph::EdgeItThis iterator goes through each edge
StaticGraph::EdgeMapReference 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::NodeMapReference map of the nodes to type T
StaticGraph::OutEdgeItThis iterator goes trough the outgoing edges of a node
StdMapstd::map wrapper
SubBidirGraphWrapperA wrapper for composing a subgraph of a bidirected graph made from a directed one
SubBidirGraphWrapper::Edge
SubBidirGraphWrapper::EdgeMap
SubGraphWrapperA graph wrapper for hiding nodes and edges from a graph
SuurballeImplementation of an algorithm for finding k edge-disjoint paths between 2 nodes of minimal total length
SymEdgeIt
SymListGraphGraph for bidirectional edges
SymMap
SymSmartGraphGraph for bidirectional edges
TimerClass measuring the cpu time and real time usage of the process
TimeStampA class to store (cpu)time instances
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
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 Thu Sep 30 12:18:36 2004 for LEMON by doxygen 1.3.8