LEMON 1.0.7

Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
AbsMap< M >Absolute value of a map
AddMap< M1, M2 >Sum of two maps
AllArcLookUp< G >Fast look-up of all arcs between given endpoints
AlterableDigraphComponent< _Base >An empty alteration notifier digraph class
AlterableGraphComponent< _Base >An empty alteration notifier undirected graph class
AndMap< M1, M2 >Logical 'and' of two maps
Digraph::ArcClass for identifying an arc of the digraph
Graph::ArcThe directed arc type
Path< _Digraph >::ArcItLEMON style iterator for path arcs
PathDumper< _Digraph >::ArcItLEMON style iterator for path arcs
Path< _Digraph >::ArcItLEMON style iterator for path arcs
SimplePath< _Digraph >::ArcItIterator class to iterate on the arcs of the paths
ListPath< _Digraph >::ArcItIterator class to iterate on the arcs of the paths
StaticPath< _Digraph >::ArcItIterator class to iterate on the arcs of the paths
Digraph::ArcItThis iterator goes through each arc
Graph::ArcItThis iterator goes through each directed arc
ArcLookUp< G >Fast arc look-up between given endpoints
Digraph::ArcMap< T >Read write map of the arcs to type T
Graph::ArcMap< T >Read write map of the directed arcs to type T
MappableDigraphComponent< _Base >::ArcMap< _Value >
ArgParserCommand line arguments parser
BackwardMap< Graph >Returns the "backward" directed arc view of an edge
BaseDigraphComponentAn empty base directed graph class
BaseGraphComponentAn empty base undirected graph class
Bfs< GR, TR >BFS algorithm class
BfsDefaultTraits< GR >Default traits class of Bfs class
BfsVisit< _Digraph, _Visitor, _Traits >BFS algorithm class with visitor interface
BfsVisitDefaultTraits< _Digraph >Default traits class of BfsVisit class
BfsVisitor< _Digraph >Visitor class for BFS
BfsWizard< TR >Auxiliary class for the function-type interface of BFS algorithm
BfsWizardBase< GR >Default traits class used by BfsWizard
BfsWizardDefaultTraits< GR >Default traits class of bfs() function
BinHeap< _Prio, _ItemIntMap, _Compare >A Binary Heap implementation
Box< T >Bounding box of plain vectors (points)
UnionFindEnum< _ItemIntMap >::ClassItLEMON style iterator for the representant items
ExtendFindEnum< _ItemIntMap >::ClassItLEMON style iterator for the classes
HeapUnionFind< _Value, _ItemIntMap, _Comp >::ClassItClass iterator
ClearableDigraphComponent< _Base >An empty clearable base digraph class
ClearableGraphComponent< _Base >An empty clearable base undirected graph class
Color
CombineMap< M1, M2, F, V >Combination of two maps using an STL (binary) functor
ComposeMap< M1, M2 >Composition of two maps
ConArcIt< _Graph >Iterator for iterating on parallel arcs connecting the same nodes
ConEdgeIt< _Graph >Iterator for iterating on parallel edges connecting the same nodes
ConstMap< K, V >Constant map
ConstMap< K, Const< V, v > >Constant map with inlined constant value
ConstXMap< M >
ConstYMap< M >
ConvertMap< M, V >Map adaptor to convert the Value type of a map to another type using the default conversion
CounterA counter class
DefaultGraphToEpsTraits< G >Default traits class of GraphToEps
Dfs< GR, TR >DFS algorithm class
DfsDefaultTraits< GR >Default traits class of Dfs class
DfsVisit< _Digraph, _Visitor, _Traits >DFS algorithm class with visitor interface
DfsVisitDefaultTraits< _Digraph >Default traits class of DfsVisit class
DfsVisitor< _Digraph >Visitor class for DFS
DfsWizard< TR >Auxiliary class for the function-type interface of DFS algorithm
DfsWizardBase< GR >Default traits class used by DfsWizard
DfsWizardDefaultTraits< GR >Default traits class of dfs() function
DigraphClass describing the concept of directed graphs
DigraphCopy< From, To >Class to copy a digraph
DigraphReader< _Digraph >LGF reader for directed graphs
DigraphWriter< _Digraph >LGF writer for directed graphs
Dijkstra< GR, LM, TR >Dijkstra algorithm class
DijkstraDefaultOperationTraits< Value >Default operation traits for the Dijkstra algorithm class
DijkstraDefaultTraits< GR, LM >Default traits class of Dijkstra class
DijkstraWizard< TR >Auxiliary class for the function-type interface of Dijkstra algorithm
DijkstraWizardBase< GR, LM >Default traits class used by DijkstraWizard
DijkstraWizardDefaultTraits< GR, LM >Default traits class of dijkstra() function
DivMap< M1, M2 >Quotient of two maps
DynArcLookUp< G >Dynamic arc look-up between given endpoints
Graph::Edge
BaseGraphComponent::EdgeUndirected arc class of the graph
Graph::EdgeItThis iterator goes through each edge
Graph::EdgeMap< T >Read write map of the edges to type T
MappableGraphComponent< _Base >::EdgeMap< _Value >
EqualMap< M1, M2 >Combination of two maps using the == operator
ErasableDigraphComponent< _Base >An empty erasable digraph class
ErasableGraphComponent< _Base >An empty erasable base undirected graph class
ExceptionGeneric exception class
ExtendableDigraphComponent< _Base >An empty extendable digraph class
ExtendableGraphComponent< _Base >An empty extendable base undirected graph class
ExtendFindEnum< _ItemIntMap >A Extend-Find data structure implementation which is able to enumerate the components
FalseMap< K >Constant false map
ForkMap< M1, M2 >Applies all map setting operations to two maps
FormatErrorFormat error
ForwardMap< Graph >Returns the "forward" directed arc view of an edge
FunctorToMap< F, K, V >Converts an STL style (unary) functor to a map
GraphClass describing the concept of Undirected Graphs
GraphCopy< From, To >Class to copy a graph
GraphIncIt< _Graph, _Item, _Base, _selector >Skeleton class for graph InArcIt and OutArcIt
GraphItemSkeleton class for graph Node and Arc types
GraphItemIt< _Graph, _Item >
GraphMap< _Graph, _Item, _Value >Class describing the concept of graph maps
GraphReader< _Graph >LGF reader for undirected graphs
GraphToEps< T >Auxiliary class to implement the named parameters of graphToEps()
GraphWriter< _Graph >LGF writer for directed graphs
Heap< Priority, ItemIntMap >The heap concept
HeapUnionFind< _Value, _ItemIntMap, _Comp >A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class
IDableDigraphComponent< _Base >An empty idable base digraph class
IDableGraphComponent< _Base >An empty idable base undirected graph class
IdentityMap< T >Identity map
IdMap< _Graph, _Item >Provides an immutable and unique id for each item in the graph
Digraph::InArcItThis iterator goes trough the incoming arcs of a node
Graph::InArcItThis iterator goes trough the incoming directed arcs of a node
Graph::IncEdgeItThis iterator goes trough the incident undirected arcs of a node
InDegMap< _Digraph >Map of the node in-degrees
InvalidDummy type to make it easier to create invalid iterators
IdMap< _Graph, _Item >::InverseMapThe class represents the inverse of its owner (IdMap)
IoErrorInput-Output error
UnionFindEnum< _ItemIntMap >::ItemItLEMON style iterator for the items of a component
ExtendFindEnum< _ItemIntMap >::ItemItLEMON style iterator for the items of a component
HeapUnionFind< _Value, _ItemIntMap, _Comp >::ItemItLEMON style iterator for the items of a class
IterableDigraphComponent< _Base >An empty iterable digraph class
IterableGraphComponent< _Base >An empty iterable undirected graph class
LessMap< M1, M2 >Combination of two maps using the < operator
LgfContentsReader for the contents of the LGF file
ListDigraphA general directed graph structure
ListGraphA general undirected graph structure
ListPath< _Digraph >A structure for representing directed paths in a digraph
LoggerBoolMap< It, Ke >Writable bool map for logging each true assigned element
MapBase< K, V >Base class of maps
MappableDigraphComponent< _Base >An empty mappable digraph class
MappableGraphComponent< _Base >An empty mappable base bipartite graph class
MapToFunctor< M >Converts a map to an STL style (unary) functor
MulMap< M1, M2 >Product of two maps
NegMap< M >Negative of a map
NegWriteMap< M >Negative of a map (read-write version)
NoCounter'Do nothing' version of Counter
Digraph::NodeClass for identifying a node of the digraph
Graph::NodeThe base type of node iterators, or in other words, the trivial node iterator
Digraph::NodeItThis iterator goes through each node
Graph::NodeItThis iterator goes through each node
Digraph::NodeMap< T >Read write map of the nodes to type T
Graph::NodeMap< T >Read write map of the nodes to type T
MappableDigraphComponent< _Base >::NodeMap< _Value >
NormSquareMap< M >Map of the normSquare() of a Point-map
NoTimeReport'Do nothing' version of TimeReport
NotMap< M >Logical 'not' of a map
NotWriteMap< M >Logical 'not' of a map (read-write version)
NullMap< K, V >Null map. (a.k.a. DoNothingMap)
OrMap< M1, M2 >Logical 'or' of two maps
Digraph::OutArcItThis iterator goes trough the outgoing arcs of a node
Graph::OutArcItThis iterator goes trough the outgoing directed arcs of a node
OutDegMap< _Digraph >Map of the node out-degrees
PaletteMap ints to different Colors
Path< _Digraph >A skeleton structure for representing directed paths in a digraph
Path< _Digraph >A structure for representing directed paths in a digraph
PathDumper< _Digraph >A skeleton structure for path dumpers
PathNodeIt< Path >Class which helps to iterate through the nodes of a path
Point< T >Two dimensional vector (plain vector)
PotentialDifferenceMap< Digraph, NodeMap >Potential difference map
RandomMersenne Twister random number generator
RangeMap< V >Map for storing values for integer keys from the range [0..size-1]
ReadMap< K, T >
ReadWriteMap< K, T >
ReferenceMap< K, T, R, CR >
ArgParser::RefTypeMagic type for operator[]
PathDumper< _Digraph >::RevArcItLEMON style iterator for path arcs
ScaleMap< M, C >Scales a map with a constant
ScaleWriteMap< M, C >Scales a map with a constant (read-write version)
SectionReaderSection reader class
SectionWriterSection writer class
Dfs< GR, TR >::SetDistMap< T >
Bfs< GR, TR >::SetDistMap< T >
Dijkstra< GR, LM, TR >::SetDistMap< T >
Dijkstra< GR, LM, TR >::SetHeap< H, CR >Named parameter for setting heap and cross reference type
Dijkstra< GR, LM, TR >::SetOperationTraits< T >Named parameter for setting OperationTraits type
Bfs< GR, TR >::SetPredMap< T >
Dfs< GR, TR >::SetPredMap< T >
Dijkstra< GR, LM, TR >::SetPredMap< T >
Dfs< GR, TR >::SetProcessedMap< T >
Bfs< GR, TR >::SetProcessedMap< T >
Dijkstra< GR, LM, TR >::SetProcessedMap< T >
Dfs< GR, TR >::SetReachedMap< T >
BfsVisit< _Digraph, _Visitor, _Traits >::SetReachedMap< T >
DfsVisit< _Digraph, _Visitor, _Traits >::SetReachedMap< T >
Bfs< GR, TR >::SetReachedMap< T >
Dijkstra< GR, LM, TR >::SetStandardHeap< H, CR >Named parameter for setting heap and cross reference type with automatic allocation
Bfs< GR, TR >::SetStandardProcessedMapNamed parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>
Dfs< GR, TR >::SetStandardProcessedMapNamed parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>
Dijkstra< GR, LM, TR >::SetStandardProcessedMapNamed parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>
ShiftMap< M, C >Shifts a map with a constant
ShiftWriteMap< M, C >Shifts a map with a constant (read-write version)
SimplePath< _Digraph >A structure for representing directed paths in a digraph
SmartDigraphA smart directed graph class
SmartDigraphBaseBase of SmartDigraph
SmartGraphA smart undirected graph class
SmartGraph::SnapshotClass to make a snapshot of the digraph and to restrore to it later
ListDigraph::SnapshotClass to make a snapshot of the digraph and restore it later
ListGraph::SnapshotClass to make a snapshot of the graph and restore it later
SmartDigraph::SnapshotClass to make a snapshot of the digraph and to restrore to it later
SourceMap< Digraph >Returns the source of the given arc
SparseMap< K, V, Compare >Map type based on std::map
StaticPath< _Digraph >A structure for representing directed paths in a digraph
SubMap< M1, M2 >Difference of two maps
TargetMap< Digraph >Returns the target of the given arc
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
Tolerance< T >A 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< long double >Long double specialization of Tolerance
TrueMap< K >Constant true map
UnionFind< _ItemIntMap >A Union-Find data structure implementation
UnionFindEnum< _ItemIntMap >A Union-Find data structure implementation which is able to enumerate the components
WriteMap< K, T >
XMap< M >Map of x-coordinates of a Point-map
YMap< M >Map of y-coordinates of a Point-map