Class Hierarchy

- Main Page
- Modules
- Classes
- Namespaces
- Files
- Related Pages

- Class List
- Class Index
- Class Hierarchy
- Class Members

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 12345]

BellmanFord< GR, LEN, TR >::ActiveIt | LEMON iterator for getting the active nodes
AlterableDigraphComponent< BAS > | Skeleton class for alterable directed graphs
AlterableGraphComponent< BAS > | Skeleton class for alterable undirected graphs
AlterableBpGraphComponent< BAS > | Skeleton class for alterable undirected bipartite graphs
Digraph::Arc | The arc type of the digraph
Digraph::ArcIt | Iterator class for the arcs
Digraph::InArcIt | Iterator class for the incoming arcs of a node
Digraph::OutArcIt | Iterator class for the outgoing arcs of a node
BpGraph::Arc | The arc type of the graph
BpGraph::ArcIt | Iterator class for the arcs
BpGraph::InArcIt | Iterator class for the incoming arcs of a node
BpGraph::OutArcIt | Iterator class for the outgoing arcs of a node
Graph::Arc | The arc type of the graph
Graph::ArcIt | Iterator class for the arcs
Graph::InArcIt | Iterator class for the incoming arcs of a node
Graph::OutArcIt | Iterator class for the outgoing arcs of a node
Path< GR >::ArcIt | LEMON style iterator for enumerating the arcs of a path
PathDumper< GR >::ArcIt | LEMON style iterator for enumerating the arcs of a path
SimplePath< GR >::ArcIt | Iterator class to iterate on the arcs of the paths
Path< GR >::ArcIt | LEMON style iterator for path arcs
ListPath< GR >::ArcIt | Iterator class to iterate on the arcs of the paths
StaticPath< GR >::ArcIt | Iterator class to iterate on the arcs of the paths
ArcLookUp< GR > | Fast arc look-up between given endpoints
AllArcLookUp< GR > | Fast look-up of all arcs between given endpoints
ArgParser | Command line arguments parser
BackwardMap< GR > | Map of the "backward" directed arc view of edges in a graph
BaseDigraphComponent | Base skeleton class for directed graphs
BaseGraphComponent | Base skeleton class for undirected graphs
BaseBpGraphComponent | Base skeleton class for undirected bipartite graphs
BellmanFord< GR, LEN, TR > | BellmanFord algorithm class
BellmanFord< Digraph, LengthMap, SetDistMapTraits< T > > |
BellmanFord< GR, LEN, TR >::SetDistMap< T > | Named parameter for setting `DistMap` type
BellmanFord< Digraph, LengthMap, SetOperationTraitsTraits< T > > |
BellmanFord< GR, LEN, TR >::SetOperationTraits< T > | Named parameter for setting `OperationTraits` type
BellmanFord< Digraph, LengthMap, SetPredMapTraits< T > > |
BellmanFord< GR, LEN, TR >::SetPredMap< T > | Named parameter for setting `PredMap` type
BellmanFordDefaultOperationTraits< V, has_inf > | Default OperationTraits for the BellmanFord algorithm class
BellmanFordDefaultTraits< GR, LEN > | Default traits class of BellmanFord class
BellmanFordWizard< TR > | Auxiliary class for the function-type interface of the Bellman-Ford algorithm
BellmanFordWizardDefaultTraits< GR, LEN > | Default traits class of bellmanFord() function
BellmanFordWizardBase< GR, LEN > | Default traits class used by BellmanFordWizard
Bfs< GR, TR > | BFS algorithm class
Bfs< Digraph, SetDistMapTraits< T > > |
Bfs< GR, TR >::SetDistMap< T > | Named parameter for setting `DistMap` type
Bfs< Digraph, SetPredMapTraits< T > > |
Bfs< GR, TR >::SetPredMap< T > | Named parameter for setting `PredMap` type
Bfs< Digraph, SetProcessedMapTraits< T > > |
Bfs< GR, TR >::SetProcessedMap< T > | Named parameter for setting `ProcessedMap` type
Bfs< Digraph, SetReachedMapTraits< T > > |
Bfs< GR, TR >::SetReachedMap< T > | Named parameter for setting `ReachedMap` type
Bfs< Digraph, SetStandardProcessedMapTraits > |
Bfs< GR, TR >::SetStandardProcessedMap | Named parameter for setting `ProcessedMap` type to be `Digraph::NodeMap<bool>`
BfsDefaultTraits< GR > | Default traits class of Bfs class
BfsVisit< GR, VS, TR > | BFS algorithm class with visitor interface
BfsVisit< Digraph, Visitor, SetReachedMapTraits< T > > |
BfsVisit< GR, VS, TR >::SetReachedMap< T > | Named parameter for setting ReachedMap type
BfsVisitDefaultTraits< GR > | Default traits class of BfsVisit class
BfsVisitor< GR > | Visitor class for BFS
BfsVisitor< Digraph > |
BfsWizard< TR > | Auxiliary class for the function-type interface of BFS algorithm
BfsWizardDefaultTraits< GR > | Default traits class of bfs() function
BfsWizardBase< GR > | Default traits class used by BfsWizard
BinHeap< PR, IM, CMP > | Binary heap data structure
BinHeap< Value, IntArcMap > |
BinHeap< Value, IntEdgeMap > |
BinHeap< Value, IntNodeMap > |
BinHeap< Value, lemon::RangeMap > |
BinomialHeap< PR, IM, CMP > | Binomial heap data structure
MaxWeightedMatching< GR, WM >::BlossomIt | Iterator for obtaining the nodes of a blossom
MaxWeightedPerfectMatching< GR, WM >::BlossomIt | Iterator for obtaining the nodes of a blossom
Box< T > | Bounding box of plain vectors (points)
BpGraph | Class describing the concept of undirected bipartite graphs
BpGraphCopy< From, To > | Class to copy a bipartite graph
BpGraphReader< BGR > | LGF reader for bipartite graphs
BpGraphWriter< BGR > | LGF writer for undirected bipartite graphs
BucketHeap< IM, MIN > | Bucket heap data structure
CapacityScaling< GR, V, C, TR > | Implementation of the Capacity Scaling algorithm for finding a minimum cost flow
CapacityScaling< GR, V, C, SetHeapTraits< T > > |
CapacityScaling< GR, V, C, TR >::SetHeap< T > | Named parameter for setting `Heap` type
CapacityScalingDefaultTraits< GR, V, C > | Default traits class of CapacityScaling algorithm
ChristofidesTsp< CM > | Christofides algorithm for symmetric TSP
Circulation< GR, LM, UM, SM, TR > | Push-relabel algorithm for the network circulation problem
Circulation< Digraph, LowerMap, UpperMap, SupplyMap, SetElevatorTraits< T > > |
Circulation< GR, LM, UM, SM, TR >::SetElevator< T > | Named parameter for setting Elevator type
Circulation< Digraph, LowerMap, UpperMap, SupplyMap, SetFlowMapTraits< T > > |
Circulation< GR, LM, UM, SM, TR >::SetFlowMap< T > | Named parameter for setting FlowMap type
Circulation< Digraph, LowerMap, UpperMap, SupplyMap, SetStandardElevatorTraits< T > > |
Circulation< GR, LM, UM, SM, TR >::SetStandardElevator< T > | Named parameter for setting Elevator type with automatic allocation
CirculationDefaultTraits< GR, LM, UM, SM > | Default traits class of Circulation class
ExtendFindEnum< IM >::ClassIt | LEMON style iterator for the classes
UnionFindEnum< IM >::ClassIt | LEMON style iterator for the representant items
HeapUnionFind< V, IM, Comp >::ClassIt | Class iterator
ClearableDigraphComponent< BAS > | Skeleton class for clearable directed graphs
ClearableGraphComponent< BAS > | Skeleton class for clearable undirected graphs
ClearableBpGraphComponent< BAS > | Skeleton class for clearable undirected biparite graphs
GrossoLocatelliPullanMc< GR >::CliqueNodeIt | Iterator to list the nodes of the found clique
LpBase::Expr::CoeffIt | Iterator over the expression
LpBase::DualExpr::CoeffIt | Iterator over the expression
LpBase::Col | Refer to a column of the LP
LpBase::ColIt | Iterator for iterate over the columns of an LP problem
GridGraph::ColMap | Map to get the column of the nodes
Color | Data structure representing RGB colors
Undirector< DGR >::CombinedArcMap< FW, BK > | Arc map combined from two original arc maps
SplitNodes< DGR >::CombinedArcMap< AM, NM > | Arc map combined from an arc map and a node map of the original digraph
SplitNodes< DGR >::CombinedNodeMap< IN, OUT > | Node map combined from two original node maps
ConArcIt< GR > | Iterator for iterating on parallel arcs connecting the same nodes
ConEdgeIt< GR > | Iterator for iterating on parallel edges connecting the same nodes
LpBase::Expr::ConstCoeffIt | Const iterator over the expression
LpBase::DualExpr::ConstCoeffIt | Iterator over the expression
LpBase::Constr | Linear constraint
ConstXMap< M > | Constant (read only) version of XMap
ConstYMap< M > | Constant (read only) version of YMap
CostScaling< GR, V, C, TR > | Implementation of the Cost Scaling algorithm for finding a minimum cost flow
CostScaling< GR, V, C, SetLargeCostTraits< T > > |
CostScaling< GR, V, C, TR >::SetLargeCost< T > | Named parameter for setting `LargeCost` type
CostScalingDefaultTraits< GR, V, C > | Default traits class of CostScaling algorithm
Counter | A counter class
CplexEnv | Reference counted wrapper around cpxenv pointer
CrossRefMap< GR, K, V > | General cross reference graph map type
CycleCanceling< GR, V, C > | Implementation of cycle-canceling algorithms for finding a minimum cost flow
DefaultGraphToEpsTraits< GR > | Default traits class of GraphToEps
Dfs< GR, TR > | DFS algorithm class
Dfs< Digraph, SetDistMapTraits< T > > |
Dfs< GR, TR >::SetDistMap< T > | Named parameter for setting `DistMap` type
Dfs< Digraph, SetPredMapTraits< T > > |
Dfs< GR, TR >::SetPredMap< T > | Named parameter for setting `PredMap` type
Dfs< Digraph, SetProcessedMapTraits< T > > |
Dfs< GR, TR >::SetProcessedMap< T > | Named parameter for setting `ProcessedMap` type
Dfs< Digraph, SetReachedMapTraits< T > > |
Dfs< GR, TR >::SetReachedMap< T > | Named parameter for setting `ReachedMap` type
Dfs< Digraph, SetStandardProcessedMapTraits > |
Dfs< GR, TR >::SetStandardProcessedMap | Named parameter for setting `ProcessedMap` type to be `Digraph::NodeMap<bool>`
DfsDefaultTraits< GR > | Default traits class of Dfs class
DfsVisit< GR, VS, TR > | DFS algorithm class with visitor interface
DfsVisit< Digraph, Visitor, SetReachedMapTraits< T > > |
DfsVisit< GR, VS, TR >::SetReachedMap< T > | Named parameter for setting ReachedMap type
DfsVisitDefaultTraits< GR > | Default traits class of DfsVisit class
DfsVisitor< GR > | Visitor class for DFS
DfsVisitor< Digraph > |
DfsVisitor< Graph > |
DfsWizard< TR > | Auxiliary class for the function-type interface of DFS algorithm
DfsWizardDefaultTraits< GR > | Default traits class of dfs() function
DfsWizardBase< GR > | Default traits class used by DfsWizard
DHeap< PR, IM, D, CMP > | D-ary heap data structure
DiEulerIt< GR > | Euler tour iterator for digraphs
Digraph | Class describing the concept of directed graphs
DigraphCopy< From, To > | Class to copy a digraph
DigraphReader< DGR > | LGF reader for directed graphs
DigraphWriter< DGR > | LGF writer for directed graphs
Dijkstra< GR, LEN, TR > | Dijkstra algorithm class
Dijkstra< Digraph, LengthMap, SetDistMapTraits< T > > |
Dijkstra< GR, LEN, TR >::SetDistMap< T > | Named parameter for setting `DistMap` type
Dijkstra< Digraph, LengthMap, SetHeapTraits< H, CR > > |
Dijkstra< GR, LEN, TR >::SetHeap< H, CR > | Named parameter for setting heap and cross reference types
Dijkstra< Digraph, LengthMap, SetOperationTraitsTraits< T > > |
Dijkstra< GR, LEN, TR >::SetOperationTraits< T > | Named parameter for setting `OperationTraits` type
Dijkstra< Digraph, LengthMap, SetPredMapTraits< T > > |
Dijkstra< GR, LEN, TR >::SetPredMap< T > | Named parameter for setting `PredMap` type
Dijkstra< Digraph, LengthMap, SetProcessedMapTraits< T > > |
Dijkstra< GR, LEN, TR >::SetProcessedMap< T > | Named parameter for setting `ProcessedMap` type
Dijkstra< Digraph, LengthMap, SetStandardHeapTraits< H, CR > > |
Dijkstra< GR, LEN, TR >::SetStandardHeap< H, CR > | Named parameter for setting heap and cross reference types with automatic allocation
Dijkstra< Digraph, LengthMap, SetStandardProcessedMapTraits > |
Dijkstra< GR, LEN, TR >::SetStandardProcessedMap | Named parameter for setting `ProcessedMap` type to be `Digraph::NodeMap<bool>`
DijkstraDefaultOperationTraits< V > | Default operation traits for the Dijkstra algorithm class
DijkstraDefaultTraits< GR, LEN > | Default traits class of Dijkstra class
DijkstraWizard< TR > | Auxiliary class for the function-type interface of Dijkstra algorithm
DijkstraWizardDefaultTraits< GR, LEN > | Default traits class of dijkstra() function
DijkstraWizardBase< GR, LEN > | Default traits class used by DijkstraWizard
DimacsDescriptor | DIMACS file type descriptor
LpBase::DualExpr | Linear expression of rows
MinCostArborescence< GR, CM, TR >::DualIt | LEMON iterator for getting a dual variable
DynArcLookUp< GR > | Dynamic arc look-up between given endpoints
BpGraph::Edge | The edge type of the graph
BpGraph::EdgeIt | Iterator class for the edges
BpGraph::IncEdgeIt | Iterator class for the incident edges of a node
Graph::Edge | The edge type of the graph
Graph::EdgeIt | Iterator class for the edges
Graph::IncEdgeIt | Iterator class for the incident edges of a node
EdmondsKarp< GR, CAP, TR > | Edmonds-Karp algorithms class
EdmondsKarp< Digraph, CapacityMap, SetFlowMapTraits< T > > |
EdmondsKarp< GR, CAP, TR >::SetFlowMap< T > | Named parameter for setting FlowMap type
EdmondsKarpDefaultTraits< GR, CAP > | Default traits class of EdmondsKarp class
Elevator< GR, Item > | Class for handling "labels" in push-relabel type algorithms
ErasableDigraphComponent< BAS > | Skeleton class for erasable directed graphs
ErasableGraphComponent< BAS > | Skeleton class for erasable undirected graphs
ErasableBpGraphComponent< BAS > | Skeleton class for erasable undirected graphs
EulerIt< GR > | Euler tour iterator for graphs
exception | STL class
Exception | Generic exception class
ArgParserException | Exception used by ArgParser
CplexEnv::LicenseError | This exception is thrown when the license check is not sufficient
FormatError | Format error
IoError | Input-Output error
LpBase::UnsupportedFormatError | Unsupported file format exception
RadixHeap< IM >::PriorityUnderflowError | Exception thrown by RadixHeap
LpBase::Expr | Linear expression of variables and a constant component
ExtendableBpGraphComponent< BAS > | Skeleton class for extendable undirected bipartite graphs
ExtendableDigraphComponent< BAS > | Skeleton class for extendable directed graphs
ExtendableGraphComponent< BAS > | Skeleton class for extendable undirected graphs
ExtendFindEnum< IM > | A Extend-Find data structure implementation which is able to enumerate the components
IterableBoolMap< GR, K >::FalseIt | Iterator for the keys mapped to `false`
FibHeap< PR, IM, CMP > | Fibonacci heap data structure
FilterArcs< DGR, AF > | Adaptor class for hiding arcs in a digraph
FilterEdges< GR, EF > | Adaptor class for hiding edges in a graph
FilterNodes< GR, NF > | Adaptor class for hiding nodes in a digraph or a graph
ForwardMap< GR > | Map of the "forward" directed arc view of edges in a graph
FullBpGraph | An undirected full bipartite graph class
FullDigraph | A directed full graph class
FullGraph | An undirected full graph class
GomoryHu< GR, CAP > | Gomory-Hu cut tree algorithm
Graph | Class describing the concept of undirected graphs
GraphCopy< From, To > | Class to copy a graph
GraphIncIt< GR, Item, Base, sel > | Concept class for `InArcIt`, `OutArcIt` and `IncEdgeIt` types
GraphItem | Concept class for `Node`, `Arc` and `Edge` types
BaseBpGraphComponent::BlueNode | Class to represent blue nodes
BaseBpGraphComponent::RedNode | Class to represent red nodes
GraphItem<'e'> |
BaseGraphComponent::Edge | Undirected edge class of the graph
GraphItemIt< GR, Item > | Concept class for `NodeIt`, `ArcIt` and `EdgeIt` types
GraphReader< GR > | LGF reader for undirected graphs
GraphToEps< T > | Auxiliary class to implement the named parameters of graphToEps()
GraphWriter< GR > | LGF writer for undirected graphs
GreedyTsp< CM > | Greedy algorithm for symmetric TSP
GridGraph | Grid graph class
GrossoLocatelliPullanMc< GR > | Implementation of the iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem
HaoOrlin< GR, CAP, TOL > | Hao-Orlin algorithm for finding a minimum cut in a digraph
HartmannOrlinMmc< GR, CM, TR > | Implementation of the Hartmann-Orlin algorithm for finding a minimum mean cycle
HartmannOrlinMmc< GR, CM, SetLargeCostTraits< T > > |
HartmannOrlinMmc< GR, CM, TR >::SetLargeCost< T > | Named parameter for setting `LargeCost` type
HartmannOrlinMmc< GR, CM, SetPathTraits< T > > |
HartmannOrlinMmc< GR, CM, TR >::SetPath< T > | Named parameter for setting `Path` type
HartmannOrlinMmcDefaultTraits< GR, CM > | Default traits class of HartmannOrlinMmc class
Heap< PR, IM, CMP > | The heap concept
HeapUnionFind< V, IM, Comp > | A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class
HowardMmc< GR, CM, TR > | Implementation of Howard's algorithm for finding a minimum mean cycle
HowardMmc< GR, CM, SetLargeCostTraits< T > > |
HowardMmc< GR, CM, TR >::SetLargeCost< T > | Named parameter for setting `LargeCost` type
HowardMmc< GR, CM, SetPathTraits< T > > |
HowardMmc< GR, CM, TR >::SetPath< T > | Named parameter for setting `Path` type
HowardMmcDefaultTraits< GR, CM > | Default traits class of HowardMmc class
HypercubeGraph | Hypercube graph class
HypercubeGraph::HyperMap< T, BF > | Linear combination map
IDableDigraphComponent< BAS > | Skeleton class for idable directed graphs
IDableGraphComponent< BAS > | Skeleton class for idable undirected graphs
IDableBpGraphComponent< BAS > | Skeleton class for idable undirected bipartite graphs
InDegMap< GR > | Map of the in-degrees of nodes in a digraph
GridGraph::IndexMap | Map to get the indices of the nodes as dim2::Point<int>
InsertionTsp< CM > | Insertion algorithm for symmetric TSP
Invalid | Dummy type to make it easier to create invalid iterators
IdMap< GR, K >::InverseMap | The inverse map type of IdMap
CrossRefMap< GR, K, V >::InverseMap | The inverse map type of CrossRefMap
RangeIdMap< GR, K >::InverseMap | The inverse map type of RangeIdMap
IterableBoolMap< GR, K >::ItemIt | Iterator for the keys mapped to a given value
IterableIntMap< GR, K >::ItemIt | Iterator for the keys with the same value
IterableValueMap< GR, K, V >::ItemIt | Iterator for the keys with the same value
UnionFindEnum< IM >::ItemIt | LEMON style iterator for the items of a component
ExtendFindEnum< IM >::ItemIt | LEMON style iterator for the items of a component
HeapUnionFind< V, IM, Comp >::ItemIt | LEMON style iterator for the items of a class
IterableBoolMap< GR, K > | Dynamic iterable `bool` map
IterableDigraphComponent< BAS > | Skeleton class for iterable directed graphs
IterableGraphComponent< BAS > | Skeleton class for iterable undirected graphs
IterableBpGraphComponent< BAS > | Skeleton class for iterable undirected bipartite graphs
IterableIntMap< GR, K > | Dynamic iterable integer map
IterableValueMap< GR, K, V > | Dynamic iterable map for comparable values
KarpMmc< GR, CM, TR > | Implementation of Karp's algorithm for finding a minimum mean cycle
KarpMmc< GR, CM, SetLargeCostTraits< T > > |
KarpMmc< GR, CM, TR >::SetLargeCost< T > | Named parameter for setting `LargeCost` type
KarpMmc< GR, CM, SetPathTraits< T > > |
KarpMmc< GR, CM, TR >::SetPath< T > | Named parameter for setting `Path` type
KarpMmcDefaultTraits< GR, CM > | Default traits class of KarpMmc class
LgfContents | Reader for the contents of the LGF file
LinkedElevator< GR, Item > | Class for handling "labels" in push-relabel type algorithms
ListArcSet< GR > | Digraph using a node set of another digraph or graph and an own arc set
ListBpGraph | A general undirected graph structure
ListDigraph | A general directed graph structure
ListEdgeSet< GR > | Graph using a node set of another digraph or graph and an own edge set
ListGraph | A general undirected graph structure
ListPath< GR > | A structure for representing directed paths in a digraph
LpBase | Common base class for LP and MIP solvers
CplexBase | Base interface for the CPLEX LP and MIP solver
CplexLp | Interface for the CPLEX LP solver
CplexMip | Interface for the CPLEX MIP solver
GlpkBase | Base interface for the GLPK LP and MIP solver
GlpkLp | Interface for the GLPK LP solver
GlpkMip | Interface for the GLPK MIP solver
LpSolver | Common base class for LP solvers
ClpLp | Interface for the CLP solver
CplexLp | Interface for the CPLEX LP solver
GlpkLp | Interface for the GLPK LP solver
LpSkeleton | Skeleton class for an LP solver interface
SoplexLp | Interface for the SOPLEX solver
MipSolver | Common base class for MIP solvers
CbcMip | Interface for the CBC MIP solver
CplexMip | Interface for the CPLEX MIP solver
GlpkMip | Interface for the GLPK MIP solver
MipSkeleton | Skeleton class for a MIP solver interface
SkeletonSolverBase | A skeleton class to implement LP/MIP solver base interface
LpSkeleton | Skeleton class for an LP solver interface
MipSkeleton | Skeleton class for a MIP solver interface
MapBase< K, V > | Base class of maps
ConstMap< K, V > | Constant map
ConstMap< K, Const< V, v > > | Constant map with inlined constant value
FunctorToMap< F, K, V > | Converts an STL style (unary) functor to a map
NullMap< K, V > | Null map. (a.k.a. DoNothingMap)
SparseMap< K, V, Comp > | Map type based on `std::map`
MapBase< GR::Edge, Const< bool, true > > |
ConstMap< GR::Edge, Const< bool, true > > |
MapBase< int, BlossomData > |
RangeMap< BlossomData > |
MapBase< int, Color > |
Palette | Map `int`s to different `Color`s
MapBase< int, NodeData > |
RangeMap< NodeData > |
MapBase< int, V > |
RangeMap< V > | Map for storing values for integer keys from the range `[0..size-1]`
MapBase< K, bool > |
FalseMap< K > | Constant `false` map
TrueMap< K > | Constant `true` map
MapBase< K, int > |
IdMap< GR, K > | Provides an immutable and unique id for each item in a graph
MapBase< KEY, bool > |
LoggerBoolMap< IT, KEY > | Writable bool map for logging each `true` assigned element
MapBase< M1::Key, bool > |
AndMap< M1, M2 > | Logical 'and' of two maps
EqualMap< M1, M2 > | Combination of two maps using the `==` operator
LessMap< M1, M2 > | Combination of two maps using the `<` operator
OrMap< M1, M2 > | Logical 'or' of two maps
MapBase< M1::Key, M1::Value > |
AddMap< M1, M2 > | Sum of two maps
DivMap< M1, M2 > | Quotient of two maps
ForkMap< M1, M2 > | Applies all map setting operations to two maps
MulMap< M1, M2 > | Product of two maps
SubMap< M1, M2 > | Difference of two maps
MapBase< M1::Key, V > |
CombineMap< M1, M2, F, V > | Combination of two maps using an STL (binary) functor
MapBase< M2::Key, M1::Value > |
ComposeMap< M1, M2 > | Composition of two maps
MapBase< M::Key, bool > |
NotMap< M > | Logical 'not' of a map
NotWriteMap< M > | Logical 'not' of a map (read-write version)
MapBase< M::Key, M::Value > |
AbsMap< M > | Absolute value of a map
MapToFunctor< M > | Converts a map to an STL style (unary) functor
NegMap< M > | Negative of a map
NegWriteMap< M > | Negative of a map (read-write version)
ScaleMap< M, C > | Scales a map with a constant
ScaleWriteMap< M, C > | Scales a map with a constant (read-write version)
ShiftMap< M, C > | Shifts a map with a constant
ShiftWriteMap< M, C > | Shifts a map with a constant (read-write version)
MapBase< M::Key, V > |
ConvertMap< M, V > | Map adaptor to convert the `Value` type of a map to another type using the default conversion
MapBase< T, T > |
IdentityMap< T > | Identity map
MapBase< typename DGR::Node, Const< bool, true > > |
ConstMap< typename DGR::Node, Const< bool, true > > |
MapBase< typename Digraph::Arc, Const< bool, true > > |
ConstMap< typename Digraph::Arc, Const< bool, true > > |
MapBase< typename GR::Edge, Const< bool, true > > |
ConstMap< typename GR::Edge, Const< bool, true > > |
MapBase< typename GR::Node, Const< bool, true > > |
ConstMap< typename GR::Node, Const< bool, true > > |
MapBase< typename Graph::Arc, double > |
ConstMap< typename Graph::Arc, double > |
MapBase< typename Graph::Arc, lemon::Color > |
ConstMap< typename Graph::Arc, lemon::Color > |
MapBase< typename Graph::Node, bool > |
ConstMap< typename Graph::Node, bool > |
MapBase< typename Graph::Node, dim2::Point< double > > |
ConstMap< typename Graph::Node, dim2::Point< double > > |
MapBase< typename Graph::Node, double > |
ConstMap< typename Graph::Node, double > |
MapBase< typename Graph::Node, int > |
ConstMap< typename Graph::Node, int > |
MapBase< typename Graph::Node, lemon::Color > |
ConstMap< typename Graph::Node, lemon::Color > |
MappableDigraphComponent< BAS > | Skeleton class for mappable directed graphs
MappableGraphComponent< BAS > | Skeleton class for mappable undirected graphs
MappableBpGraphComponent< BAS > | Skeleton class for mappable undirected bipartite graphs
MaxCardinalitySearch< GR, CAP, TR > | Maximum Cardinality Search algorithm class
MaxCardinalitySearch< Digraph, CapacityMap, DefCapacityMapTraits< T > > |
MaxCardinalitySearch< GR, CAP, TR >::SetCapacityMap< T > | Named parameter for setting CapacityMap type
MaxCardinalitySearch< Digraph, CapacityMap, DefCardinalityMapTraits< T > > |
MaxCardinalitySearch< GR, CAP, TR >::SetCardinalityMap< T > | Named parameter for setting CardinalityMap type
MaxCardinalitySearch< Digraph, CapacityMap, DefHeapTraits< H, CR > > |
MaxCardinalitySearch< GR, CAP, TR >::SetHeap< H, CR > | Named parameter for setting heap and cross reference type
MaxCardinalitySearch< Digraph, CapacityMap, DefProcessedMapTraits< T > > |
MaxCardinalitySearch< GR, CAP, TR >::SetProcessedMap< T > | Named parameter for setting ProcessedMap type
MaxCardinalitySearch< Digraph, CapacityMap, DefStandardHeapTraits< H, CR > > |
MaxCardinalitySearch< GR, CAP, TR >::SetStandardHeap< H, CR > | Named parameter for setting heap and cross reference type with automatic allocation
MaxCardinalitySearchDefaultTraits< GR, CAP > | Default traits class of MaxCardinalitySearch class
MaxFractionalMatching< GR, TR > | Max cardinality fractional matching
MaxFractionalMatching< Graph, SetElevatorTraits< T > > |
MaxFractionalMatching< GR, TR >::SetElevator< T > | Named parameter for setting Elevator type
MaxFractionalMatching< Graph, SetMatchingMapTraits< T > > |
MaxFractionalMatching< GR, TR >::SetMatchingMap< T > | Named parameter for setting MatchingMap type
MaxFractionalMatching< Graph, SetStandardElevatorTraits< T > > |
MaxFractionalMatching< GR, TR >::SetStandardElevator< T > | Named parameter for setting Elevator type with automatic allocation
MaxFractionalMatchingDefaultTraits< GR > | Default traits class of MaxFractionalMatching class
MaxMatching< GR > | Maximum cardinality matching in general graphs
MaxWeightedFractionalMatching< GR, WM > | Weighted fractional matching in general graphs
MaxWeightedMatching< GR, WM > | Weighted matching in general graphs
MaxWeightedPerfectFractionalMatching< GR, WM > | Weighted fractional perfect matching in general graphs
MaxWeightedPerfectMatching< GR, WM > | Weighted perfect matching in general graphs
MinCostArborescence< GR, CM, TR > | Minimum Cost Arborescence algorithm class
MinCostArborescence< Digraph, CostMap, SetArborescenceMapTraits< T > > |
MinCostArborescence< GR, CM, TR >::SetArborescenceMap< T > | Named parameter for setting `ArborescenceMap` type
MinCostArborescence< Digraph, CostMap, SetPredMapTraits< T > > |
MinCostArborescence< GR, CM, TR >::SetPredMap< T > | Named parameter for setting `PredMap` type
MinCostArborescenceDefaultTraits< GR, CM > | Default traits class for MinCostArborescence class
GomoryHu< GR, CAP >::MinCutEdgeIt | Iterate on the edges of a minimum cut
GomoryHu< GR, CAP >::MinCutNodeIt | Iterate on the nodes of a minimum cut
NagamochiIbaraki< GR, CM, TR > | Calculates the minimum cut in an undirected graph
NagamochiIbaraki< Graph, CapacityMap, SetHeapTraits< H, CR > > |
NagamochiIbaraki< GR, CM, TR >::SetHeap< H, CR > | Named parameter for setting heap and cross reference type
NagamochiIbaraki< Graph, CapacityMap, SetStandardHeapTraits< H, CR > > |
NagamochiIbaraki< GR, CM, TR >::SetStandardHeap< H, CR > | Named parameter for setting heap and cross reference type with automatic allocation
NagamochiIbaraki< Graph, CapacityMap, SetUnitCapacityTraits > |
NagamochiIbaraki< GR, CM, TR >::SetUnitCapacity | Named parameter for setting the capacity map to a constMap<Edge, int, 1>() instance
NagamochiIbarakiDefaultTraits< GR, CM > | Default traits class for NagamochiIbaraki class
NearestNeighborTsp< CM > | Nearest neighbor algorithm for symmetric TSP
NetworkSimplex< GR, V, C > | Implementation of the primal Network Simplex algorithm for finding a minimum cost flow
NoCounter | 'Do nothing' version of Counter
BpGraph::Node | The node type of the graph
BpGraph::BlueNode | Class to represent blue nodes
BpGraph::BlueNodeIt | Iterator class for the blue nodes
BpGraph::NodeIt | Iterator class for the nodes
BpGraph::RedNode | Class to represent red nodes
BpGraph::RedNodeIt | Iterator class for the red nodes
Digraph::Node | The node type of the digraph
Digraph::NodeIt | Iterator class for the nodes
Graph::Node | The node type of the graph
Graph::NodeIt | Iterator class for the nodes
NormSquareMap< M > | Map of the normSquare() of a `Point`-map
NoTimeReport | 'Do nothing' version of TimeReport
Opt2Tsp< CM > | 2-opt algorithm for symmetric TSP
Orienter< GR, DM > | Adaptor class for orienting the edges of a graph to get a digraph
OutDegMap< GR > | Map of the out-degrees of nodes in a digraph
PairingHeap< PR, IM, CMP > | Pairing Heap
Path< GR > | A structure for representing directed paths in a digraph
Path< GR > | A skeleton structure for representing directed paths in a digraph
PathDumper< GR > | A skeleton structure for path dumpers
PathNodeIt< Path > | Class which helps to iterate through the nodes of a path
PlanarColoring< Graph > | Coloring planar graphs
PlanarDrawing< Graph > | Schnyder's planar drawing algorithm
PlanarEmbedding< Graph > | Planar embedding of an undirected simple graph
Point< T > | Two dimensional vector (plain vector)
Point< double > |
PotentialDifferenceMap< GR, POT > | Potential difference map
Preflow< GR, CAP, TR > | Preflow algorithm class
Preflow< Digraph, CapacityMap, SetElevatorTraits< T > > |
Preflow< GR, CAP, TR >::SetElevator< T > | Named parameter for setting Elevator type
Preflow< Digraph, CapacityMap, SetFlowMapTraits< T > > |
Preflow< GR, CAP, TR >::SetFlowMap< T > | Named parameter for setting FlowMap type
Preflow< Digraph, CapacityMap, SetStandardElevatorTraits< T > > |
Preflow< GR, CAP, TR >::SetStandardElevator< T > | Named parameter for setting Elevator type with automatic allocation
PreflowDefaultTraits< GR, CAP > | Default traits class of Preflow class
QuadHeap< PR, IM, CMP > | Fourary (quaternary) heap data structure
RadixHeap< IM > | Radix heap data structure
Random | Mersenne Twister random number generator
RangeIdMap< GR, K > | Provides continuous and unique id for the items of a graph
ReadMap< K, T > | Readable map concept
ReadWriteMap< K, T > | Read/writable map concept
ReferenceMap< K, T, R, CR > | Dereferable map concept
ReferenceMap< Arc, T, T &, const T & > |
BpGraph::ArcMap< T > | Standard graph map type for the arcs
Digraph::ArcMap< T > | Standard graph map type for the arcs
Graph::ArcMap< T > | Standard graph map type for the arcs
ReferenceMap< Arc, V, V &, const V & > |
GraphMap< MappableDigraphComponent, Arc, V > |
MappableDigraphComponent< BAS >::ArcMap< V > | Standard graph map for the arcs
ReferenceMap< Edge, T, T &, const T & > |
BpGraph::EdgeMap< T > | Standard graph map type for the edges
Graph::EdgeMap< T > | Standard graph map type for the edges
ReferenceMap< Edge, V, V &, const V & > |
GraphMap< MappableGraphComponent, Edge, V > |
MappableGraphComponent< BAS >::EdgeMap< V > | Standard graph map for the edges
ReferenceMap< Node, T, T &, const T & > |
BpGraph::BlueNodeMap< T > | Standard graph map type for the blue nodes
BpGraph::NodeMap< T > | Standard graph map type for the nodes
BpGraph::RedNodeMap< T > | Standard graph map type for the red nodes
Digraph::NodeMap< T > | Standard graph map type for the nodes
Graph::NodeMap< T > | Standard graph map type for the nodes
ReferenceMap< Node, V, V &, const V & > |
GraphMap< MappableBpGraphComponent, Node, V > |
MappableBpGraphComponent< BAS >::BlueNodeMap< V > | Standard graph map for the blue nodes
MappableBpGraphComponent< BAS >::RedNodeMap< V > | Standard graph map for the red nodes
GraphMap< MappableDigraphComponent, Node, V > |
MappableDigraphComponent< BAS >::NodeMap< V > | Standard graph map for the nodes
ReadWriteMap< Arc, T > |
ReadWriteMap< Arc, V > |
ReadWriteMap< Edge, T > |
ReadWriteMap< Edge, V > |
ReadWriteMap< Node, T > |
ReadWriteMap< Node, V > |
ReadMap< Arc, T > |
ReadMap< Arc, V > |
ReadMap< Edge, T > |
ReadMap< Edge, V > |
ReadMap< K, V > |
ReadWriteMap< K, V > |
ReferenceMap< K, V, V &, const V & > |
GraphMap< GR, K, V > | Concept class for standard graph maps
ReadMap< Node, T > |
ReadMap< Node, V > |
IterableBoolMap< GR, K >::Reference | Reference to the value of the map
IterableIntMap< GR, K >::Reference | Reference to the value of the map
ArgParser::RefType | Magic type for operator[]
ResidualDigraph< DGR, CM, FM, TL >::ResidualCapacity | Residual capacity map
ResidualDigraph< DGR, CM, FM, TL > | Adaptor class for composing the residual digraph for directed flow and circulation problems
PathDumper< GR >::RevArcIt | LEMON style iterator for enumerating the arcs of a path in reverse direction
ReverseDigraph< DGR > | Adaptor class for reversing the orientation of the arcs in a digraph
LpBase::Row | Refer to a row of the LP
LpBase::RowIt | Iterator for iterate over the rows of an LP problem
GridGraph::RowMap | Map to get the row of the nodes
SectionReader | Section reader class
SectionWriter | Section writer class
SimpleBucketHeap< IM, MIN > | Simplified bucket heap data structure
SimplePath< GR > | A structure for representing directed paths in a digraph
SmartArcSet< GR > | Digraph using a node set of another digraph or graph and an own arc set
SmartBpGraph | A smart undirected bipartite graph class
SmartDigraph | A smart directed graph class
SmartEdgeSet< GR > | Graph using a node set of another digraph or graph and an own edge set
SmartGraph | A smart undirected graph class
SmartBpGraph::Snapshot | Class to make a snapshot of the graph and to restore it later
SmartDigraph::Snapshot | Class to make a snapshot of the digraph and to restore it later
ListDigraph::Snapshot | Class to make a snapshot of the digraph and restore it later
ListBpGraph::Snapshot | Class to make a snapshot of the graph and restore it later
SmartGraph::Snapshot | Class to make a snapshot of the graph and to restore it later
ListGraph::Snapshot | Class to make a snapshot of the graph and restore it later
SourceMap< GR > | Map of the source nodes of arcs in a digraph
SplitNodes< DGR > | Adaptor class for splitting the nodes of a digraph
StaticDigraph | A static directed graph class
StaticPath< GR > | A structure for representing directed paths in a digraph
SubDigraph< DGR, NF, AF > | Adaptor class for hiding nodes and arcs in a digraph
SubGraph< GR, NF, EF > | Adaptor class for hiding nodes and edges in an undirected graph
Suurballe< GR, LEN, TR > | Algorithm for finding arc-disjoint paths between two nodes having minimum total length
Suurballe< GR, LEN, SetFlowMapTraits< T > > |
Suurballe< GR, LEN, TR >::SetFlowMap< T > | Named parameter for setting `FlowMap` type
Suurballe< GR, LEN, SetHeapTraits< H, CR > > |
Suurballe< GR, LEN, TR >::SetHeap< H, CR > | Named parameter for setting `Heap` and `HeapCrossRef` types
Suurballe< GR, LEN, SetPathTraits< T > > |
Suurballe< GR, LEN, TR >::SetPath< T > | Named parameter for setting `Path` type
Suurballe< GR, LEN, SetPotentialMapTraits< T > > |
Suurballe< GR, LEN, TR >::SetPotentialMap< T > | Named parameter for setting `PotentialMap` type
SuurballeDefaultTraits< GR, LEN > | Default traits class of Suurballe algorithm
TargetMap< GR > | Map of the target nodes of arcs in a digraph
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< 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
IterableBoolMap< GR, K >::TrueIt | Iterator for the keys mapped to `true`
Undirector< DGR > | Adaptor class for viewing a digraph as an undirected graph
Undirector< const Digraph > |
UnionFind< IM > | A Union-Find data structure implementation
UnionFindEnum< IM > | A Union-Find data structure implementation which is able to enumerate the components
CrossRefMap< GR, K, V >::ValueIt | Forward iterator for values
IterableValueMap< GR, K, V >::ValueIt | Forward iterator for values
WriteMap< K, T > | Writable map concept
ReadWriteMap< K, T > | Read/writable map concept
ReadWriteMap< Arc, T > |
ReadWriteMap< Arc, V > |
ReadWriteMap< Edge, T > |
ReadWriteMap< Edge, V > |
ReadWriteMap< Node, T > |
ReadWriteMap< Node, V > |
WriteMap< Arc, T > |
WriteMap< Arc, V > |
WriteMap< Edge, T > |
WriteMap< Edge, V > |
WriteMap< K, V > |
ReadWriteMap< K, V > |
WriteMap< Node, T > |
WriteMap< Node, V > |
XMap< M > | Map of x-coordinates of a `Point`-map
YMap< M > | Map of y-coordinates of a `Point`-map