AbsMap | Absolute value of a map |
AddMap | Sum of two maps |
AllArcLookUp | Fast look-up of all arcs between given endpoints |
AlterableDigraphComponent | An empty alteration notifier digraph class |
AlterableGraphComponent | An empty alteration notifier undirected graph class |
AndMap | Logical 'and' of two maps |
ArcLookUp | Fast arc look-up between given endpoints |
ArgParser | Command line arguments parser |
ArgParser::RefType | Magic type for operator[] |
BackwardMap | Returns the "backward" directed arc view of an edge |
BaseDigraphComponent | An empty base directed graph class |
BaseGraphComponent | An empty base undirected graph class |
BaseGraphComponent::Edge | Undirected arc class of the graph |
Bfs | BFS algorithm class |
Bfs::SetDistMap | Named parameter for setting DistMap type |
Bfs::SetPredMap | Named parameter for setting PredMap type |
Bfs::SetProcessedMap | Named parameter for setting ProcessedMap type |
Bfs::SetReachedMap | Named parameter for setting ReachedMap type |
Bfs::SetStandardProcessedMap | Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> |
BfsDefaultTraits | Default traits class of Bfs class |
BfsVisit | BFS algorithm class with visitor interface |
BfsVisit::SetReachedMap | Named parameter for setting ReachedMap type |
BfsVisitDefaultTraits | Default traits class of BfsVisit class |
BfsVisitor | Visitor class for BFS |
BfsWizard | Auxiliary class for the function-type interface of BFS algorithm |
BfsWizardBase | Default traits class used by BfsWizard |
BfsWizardDefaultTraits | Default traits class of bfs() function |
BinHeap | A Binary Heap implementation |
Box | Bounding box of plain vectors (points) |
ClearableDigraphComponent | An empty clearable base digraph class |
ClearableGraphComponent | An empty clearable base undirected graph class |
Color | Data structure representing RGB colors |
CombineMap | Combination of two maps using an STL (binary) functor |
ComposeMap | Composition of two maps |
ConArcIt | Iterator for iterating on parallel arcs connecting the same nodes |
ConEdgeIt | Iterator for iterating on parallel edges connecting the same nodes |
ConstMap | Constant map |
ConstMap< K, Const< V, v > > | Constant map with inlined constant value |
ConstXMap | |
ConstYMap | |
ConvertMap | Map adaptor to convert the Value type of a map to another type using the default conversion |
Counter | A counter class |
DefaultGraphToEpsTraits | Default traits class of GraphToEps |
Dfs | DFS algorithm class |
Dfs::SetDistMap | Named parameter for setting DistMap type |
Dfs::SetPredMap | Named parameter for setting PredMap type |
Dfs::SetProcessedMap | Named parameter for setting ProcessedMap type |
Dfs::SetReachedMap | Named parameter for setting ReachedMap type |
Dfs::SetStandardProcessedMap | Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> |
DfsDefaultTraits | Default traits class of Dfs class |
DfsVisit | DFS algorithm class with visitor interface |
DfsVisit::SetReachedMap | Named parameter for setting ReachedMap type |
DfsVisitDefaultTraits | Default traits class of DfsVisit class |
DfsVisitor | Visitor class for DFS |
DfsWizard | Auxiliary class for the function-type interface of DFS algorithm |
DfsWizardBase | Default traits class used by DfsWizard |
DfsWizardDefaultTraits | Default traits class of dfs() function |
Digraph | Class describing the concept of directed graphs |
Digraph::Arc | Class for identifying an arc of the digraph |
Digraph::ArcIt | This iterator goes through each arc |
Digraph::ArcMap | Read write map of the arcs to type T |
Digraph::InArcIt | This iterator goes trough the incoming arcs of a node |
Digraph::Node | Class for identifying a node of the digraph |
Digraph::NodeIt | This iterator goes through each node |
Digraph::NodeMap | Read write map of the nodes to type T |
Digraph::OutArcIt | This iterator goes trough the outgoing arcs of a node |
DigraphCopy | Class to copy a digraph |
DigraphReader | LGF reader for directed graphs |
DigraphWriter | LGF writer for directed graphs |
Dijkstra | Dijkstra algorithm class |
Dijkstra::SetDistMap | Named parameter for setting DistMap type |
Dijkstra::SetHeap | Named parameter for setting heap and cross reference type |
Dijkstra::SetOperationTraits | Named parameter for setting OperationTraits type |
Dijkstra::SetPredMap | Named parameter for setting PredMap type |
Dijkstra::SetProcessedMap | Named parameter for setting ProcessedMap type |
Dijkstra::SetStandardHeap | Named parameter for setting heap and cross reference type with automatic allocation |
Dijkstra::SetStandardProcessedMap | Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> |
DijkstraDefaultOperationTraits | Default operation traits for the Dijkstra algorithm class |
DijkstraDefaultTraits | Default traits class of Dijkstra class |
DijkstraWidestPathOperationTraits | Widest path operation traits for the Dijkstra algorithm class |
DijkstraWizard | Auxiliary class for the function-type interface of Dijkstra algorithm |
DijkstraWizardBase | Default traits class used by DijkstraWizard |
DijkstraWizardDefaultTraits | Default traits class of dijkstra() function |
DivMap | Quotient of two maps |
DynArcLookUp | Dynamic arc look-up between given endpoints |
EqualMap | Combination of two maps using the == operator |
ErasableDigraphComponent | An empty erasable digraph class |
ErasableGraphComponent | An empty erasable base undirected graph class |
Exception | Generic exception class |
ExtendableDigraphComponent | An empty extendable digraph class |
ExtendableGraphComponent | An empty extendable base undirected graph class |
ExtendFindEnum | A Extend-Find data structure implementation which is able to enumerate the components |
ExtendFindEnum::ClassIt | LEMON style iterator for the classes |
ExtendFindEnum::ItemIt | LEMON style iterator for the items of a component |
FalseMap | Constant false map |
ForkMap | Applies all map setting operations to two maps |
FormatError | Format error |
ForwardMap | Returns the "forward" directed arc view of an edge |
FunctorToMap | Converts an STL style (unary) functor to a map |
Graph | Class describing the concept of Undirected Graphs |
Graph::Arc | The directed arc type |
Graph::ArcIt | This iterator goes through each directed arc |
Graph::ArcMap | Read write map of the directed arcs to type T |
Graph::Edge | The base type of the edge iterators |
Graph::EdgeIt | This iterator goes through each edge |
Graph::EdgeMap | Read write map of the edges to type T |
Graph::InArcIt | This iterator goes trough the incoming directed arcs of a node |
Graph::IncEdgeIt | This iterator goes trough the incident undirected arcs of a node |
Graph::Node | The base type of node iterators, or in other words, the trivial node iterator |
Graph::NodeIt | This iterator goes through each node |
Graph::NodeMap | Read write map of the nodes to type T |
Graph::OutArcIt | This iterator goes trough the outgoing directed arcs of a node |
GraphCopy | Class to copy a graph |
GraphIncIt | Skeleton class for graph InArcIt and OutArcIt |
GraphItem | Skeleton class for graph Node and Arc types |
GraphItemIt | Skeleton class for graph NodeIt and ArcIt |
GraphMap | Class describing the concept of graph maps |
GraphReader | LGF reader for undirected graphs |
GraphToEps | Auxiliary class to implement the named parameters of graphToEps() |
GraphWriter | LGF writer for directed graphs |
Heap | The heap concept |
HeapUnionFind | A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class |
HeapUnionFind::ClassIt | Class iterator |
HeapUnionFind::ItemIt | LEMON style iterator for the items of a class |
IDableDigraphComponent | An empty idable base digraph class |
IDableGraphComponent | An empty idable base undirected graph class |
IdentityMap | Identity map |
IdMap | Provides an immutable and unique id for each item in the graph |
IdMap::InverseMap | The class represents the inverse of its owner (IdMap) |
InDegMap | Map of the node in-degrees |
Invalid | Dummy type to make it easier to create invalid iterators |
IoError | Input-Output error |
IterableDigraphComponent | An empty iterable digraph class |
IterableGraphComponent | An empty iterable undirected graph class |
LessMap | Combination of two maps using the < operator |
LgfContents | Reader for the contents of the LGF file |
ListDigraph | A general directed graph structure |
ListDigraph::Snapshot | Class to make a snapshot of the digraph and restore it later |
ListGraph | A general undirected graph structure |
ListGraph::Snapshot | Class to make a snapshot of the graph and restore it later |
ListPath | A structure for representing directed paths in a digraph |
ListPath::ArcIt | Iterator class to iterate on the arcs of the paths |
LoggerBoolMap | Writable bool map for logging each true assigned element |
MapBase | Base class of maps |
MappableDigraphComponent | An empty mappable digraph class |
MappableDigraphComponent::ArcMap | ReadWrite map of the arcs |
MappableDigraphComponent::NodeMap | ReadWrite map of the nodes |
MappableGraphComponent | An empty mappable base bipartite graph class |
MappableGraphComponent::EdgeMap | ReadWrite map of the edges |
MapToFunctor | Converts a map to an STL style (unary) functor |
MulMap | Product of two maps |
NegMap | Negative of a map |
NegWriteMap | Negative of a map (read-write version) |
NoCounter | 'Do nothing' version of Counter |
NormSquareMap | Map of the normSquare() of a Point -map |
NoTimeReport | 'Do nothing' version of TimeReport |
NotMap | Logical 'not' of a map |
NotWriteMap | Logical 'not' of a map (read-write version) |
NullMap | Null map. (a.k.a. DoNothingMap) |
OrMap | Logical 'or' of two maps |
OutDegMap | Map of the node out-degrees |
Palette | Map int s to different Color s |
Path | A structure for representing directed paths in a digraph |
Path | A skeleton structure for representing directed paths in a digraph |
Path::ArcIt | LEMON style iterator for path arcs |
Path::ArcIt | LEMON style iterator for path arcs |
PathDumper | A skeleton structure for path dumpers |
PathDumper::ArcIt | LEMON style iterator for path arcs |
PathDumper::RevArcIt | LEMON style iterator for path arcs |
PathNodeIt | Class which helps to iterate through the nodes of a path |
Point | Two dimensional vector (plain vector) |
PotentialDifferenceMap | Potential difference map |
Random | Mersenne Twister random number generator |
RangeMap | Map for storing values for integer keys from the range [0..size-1] |
ReadMap | Readable map concept |
ReadWriteMap | Read/writable map concept |
ReferenceMap | Dereferable map concept |
ScaleMap | Scales a map with a constant |
ScaleWriteMap | Scales a map with a constant (read-write version) |
SectionReader | Section reader class |
SectionWriter | Section writer class |
ShiftMap | Shifts a map with a constant |
ShiftWriteMap | Shifts a map with a constant (read-write version) |
SimplePath | A structure for representing directed paths in a digraph |
SimplePath::ArcIt | Iterator class to iterate on the arcs of the paths |
SmartDigraph | A smart directed graph class |
SmartDigraph::Snapshot | Class to make a snapshot of the digraph and to restrore to it later |
SmartDigraphBase | Base of SmartDigraph |
SmartGraph | A smart undirected graph class |
SmartGraph::Snapshot | Class to make a snapshot of the digraph and to restrore to it later |
SourceMap | Returns the source of the given arc |
SparseMap | Map type based on std::map |
StaticPath | A structure for representing directed paths in a digraph |
StaticPath::ArcIt | Iterator class to iterate on the arcs of the paths |
SubMap | Difference of two maps |
TargetMap | Returns the target of the given arc |
Timer | Class for measuring the cpu time and real time usage of the process |
TimeReport | Same as Timer but prints a report on destruction |
TimeStamp | A class to store (cpu)time instances |
Tolerance | 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< int > | Integer specialization of Tolerance |
Tolerance< long double > | Long double specialization of Tolerance |
Tolerance< long int > | Long integer specialization of Tolerance |
Tolerance< unsigned int > | Unsigned integer specialization of Tolerance |
Tolerance< unsigned long int > | Unsigned long integer specialization of Tolerance |
TrueMap | Constant true map |
UnionFind | A Union-Find data structure implementation |
UnionFindEnum | A Union-Find data structure implementation which is able to enumerate the components |
UnionFindEnum::ClassIt | LEMON style iterator for the representant items |
UnionFindEnum::ItemIt | LEMON style iterator for the items of a component |
WriteMap | Writable map concept |
XMap | Map of x-coordinates of a Point -map |
YMap | Map of y-coordinates of a Point -map |