| AbsMap< M > | Absolute value of a map |
| AddMap< M1, M2 > | Sum of two maps |
| AllArcLookUp< GR > | Fast look-up of all arcs between given endpoints |
| AlterableDigraphComponent< BAS > | Skeleton class for alterable directed graphs |
| AlterableGraphComponent< BAS > | Skeleton class for alterable undirected graphs |
| AndMap< M1, M2 > | Logical 'and' of two maps |
| Digraph::Arc | Class for identifying an arc of the digraph |
| Graph::Arc | The directed arc type |
| Digraph::ArcIt | This iterator goes through each arc |
| Graph::ArcIt | This iterator goes through each directed arc |
| Path< GR >::ArcIt | LEMON style iterator for path arcs |
| PathDumper< GR >::ArcIt | LEMON style iterator for path arcs |
| 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 |
| Digraph::ArcMap< T > | |
| Graph::ArcMap< T > | |
| MappableDigraphComponent< BAS >::ArcMap< V > | Standard graph map for the arcs |
| 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 |
| Bfs< GR, TR > | BFS algorithm class |
| BfsDefaultTraits< GR > | Default traits class of Bfs class |
| BfsVisit< GR, VS, TR > | BFS algorithm class with visitor interface |
| BfsVisitDefaultTraits< GR > | Default traits class of BfsVisit class |
| BfsVisitor< GR > | 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< PR, IM, CMP > | A Binary Heap implementation |
| 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) |
| BucketHeap< IM, MIN > | A Bucket Heap implementation |
| CbcMip | Interface for the CBC MIP solver |
| Circulation< GR, LM, UM, SM, TR > | Push-relabel algorithm for the network circulation problem |
| CirculationDefaultTraits< GR, LM, UM, SM > | Default traits class of Circulation class |
| UnionFindEnum< IM >::ClassIt | LEMON style iterator for the representant items |
| ExtendFindEnum< IM >::ClassIt | LEMON style iterator for the classes |
| HeapUnionFind< V, IM, Comp >::ClassIt | Class iterator |
| ClearableDigraphComponent< BAS > | Skeleton class for clearable directed graphs |
| ClearableGraphComponent< BAS > | Skeleton class for clearable undirected graphs |
| ClpLp | Interface for the CLP solver |
| 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 | |
| Color | |
| 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 |
| CombineMap< M1, M2, F, V > | Combination of two maps using an STL (binary) functor |
| ComposeMap< M1, M2 > | Composition of two 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 |
| ConstMap< K, V > | Constant map |
| ConstMap< K, Const< V, v > > | Constant map with inlined constant value |
| LpBase::Constr | Linear constraint |
| ConstXMap< M > | |
| ConstYMap< M > | |
| ConvertMap< M, V > | Map adaptor to convert the Value type of a map to another type using the default conversion |
| Counter | A counter class |
| CplexBase | Base interface for the CPLEX LP and MIP solver |
| CplexEnv | Reference counted wrapper around cpxenv pointer |
| CplexLp | Interface for the CPLEX LP solver |
| CplexMip | Interface for the CPLEX MIP solver |
| CrossRefMap< GR, K, V > | General cross reference graph map type |
| DefaultGraphToEpsTraits< GR > | Default traits class of GraphToEps |
| Dfs< GR, TR > | DFS algorithm class |
| DfsDefaultTraits< GR > | Default traits class of Dfs class |
| DfsVisit< GR, VS, TR > | DFS algorithm class with visitor interface |
| DfsVisitDefaultTraits< GR > | Default traits class of DfsVisit class |
| DfsVisitor< GR > | 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 |
| 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 |
| 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 |
| DijkstraWizardBase< GR, LEN > | Default traits class used by DijkstraWizard |
| DijkstraWizardDefaultTraits< GR, LEN > | Default traits class of dijkstra() function |
| DimacsDescriptor | DIMACS file type descriptor |
| DivMap< M1, M2 > | Quotient of two maps |
| 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 |
| Graph::Edge | |
| BaseGraphComponent::Edge | Undirected edge class of the graph |
| Graph::EdgeIt | This iterator goes through each edge |
| Graph::EdgeMap< T > | |
| MappableGraphComponent< BAS >::EdgeMap< V > | Standard graph map for the edges |
| Elevator< GR, Item > | Class for handling "labels" in push-relabel type algorithms |
| EqualMap< M1, M2 > | Combination of two maps using the == operator |
| ErasableDigraphComponent< BAS > | Skeleton class for erasable directed graphs |
| ErasableGraphComponent< BAS > | Skeleton class for erasable undirected graphs |
| EulerIt< GR > | Euler tour iterator for graphs |
| Exception | Generic exception class |
| LpBase::Expr | Linear expression of variables and a constant component |
| 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 |
| FalseMap< K > | Constant false map |
| FibHeap< PRIO, IM, CMP > | Fibonacci Heap |
| 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 |
| ForkMap< M1, M2 > | Applies all map setting operations to two maps |
| FormatError | Format error |
| ForwardMap< GR > | Map of the "forward" directed arc view of edges in a graph |
| FullDigraph | A full digraph class |
| FullGraph | An undirected full graph class |
| FunctorToMap< F, K, V > | Converts an STL style (unary) functor to a map |
| GlpkBase | Base interface for the GLPK LP and MIP solver |
| GlpkLp | Interface for the GLPK LP solver |
| GlpkMip | Interface for the GLPK MIP solver |
| 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 |
| GraphItemIt< GR, Item > | Concept class for NodeIt, ArcIt and EdgeIt types |
| GraphMap< GR, K, V > | Concept class for standard graph maps |
| GraphReader< GR > | LGF reader for undirected graphs |
| GraphToEps< T > | Auxiliary class to implement the named parameters of graphToEps() |
| GraphWriter< GR > | LGF writer for directed graphs |
| GridGraph | Grid graph class |
| HaoOrlin< GR, CAP, TOL > | Hao-Orlin algorithm for finding a minimum cut in a digraph |
| Heap< PR, IM, Comp > | 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 |
| 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 |
| IdentityMap< T > | Identity map |
| IdMap< GR, K > | Provides an immutable and unique id for each item in a graph |
| Digraph::InArcIt | This iterator goes trough the incoming arcs of a node |
| 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 |
| InDegMap< GR > | Map of the in-degrees of nodes in a digraph |
| GridGraph::IndexMap | |
| Invalid | Dummy type to make it easier to create invalid iterators |
| IdMap< GR, K >::InverseMap | This class represents the inverse of its owner (IdMap) |
| CrossRefMap< GR, K, V >::InverseMap | The inverse map type |
| RangeIdMap< GR, K >::InverseMap | |
| IoError | Input-Output error |
| 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 |
| UnionFindEnum< IM >::ItemIt | LEMON style iterator for the items of a component |
| IterableDigraphComponent< BAS > | Skeleton class for iterable directed graphs |
| IterableGraphComponent< BAS > | Skeleton class for iterable undirected graphs |
| LessMap< M1, M2 > | Combination of two maps using the < operator |
| LgfContents | Reader for the contents of the LGF file |
| CplexEnv::LicenseError | This exception is thrown when the license check is not sufficient |
| 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 |
| 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 |
| LoggerBoolMap< IT, KEY > | Writable bool map for logging each true assigned element |
| LpBase | Common base class for LP and MIP solvers |
| LpSkeleton | Skeleton class for an LP solver interface |
| LpSolver | Common base class for LP solvers |
| MapBase< K, V > | Base class of maps |
| MappableDigraphComponent< BAS > | Skeleton class for mappable directed graphs |
| MappableGraphComponent< BAS > | Skeleton class for mappable undirected graphs |
| MapToFunctor< M > | Converts a map to an STL style (unary) functor |
| MaxMatching< GR > | Maximum cardinality matching in general graphs |
| MaxWeightedMatching< GR, WM > | Weighted matching in general graphs |
| MaxWeightedPerfectMatching< GR, WM > | Weighted perfect matching in general graphs |
| MinCostArborescence< GR, CM, TR > | Minimum Cost Arborescence algorithm class |
| 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 |
| MipSkeleton | Skeleton class for a MIP solver interface |
| MipSolver | Common base class for MIP solvers |
| MulMap< M1, M2 > | Product of two maps |
| NegMap< M > | Negative of a map |
| NegWriteMap< M > | Negative of a map (read-write version) |
| NetworkSimplex< GR, V, C > | Implementation of the primal Network Simplex algorithm for finding a minimum cost flow |
| NoCounter | 'Do nothing' version of Counter |
| Digraph::Node | Class for identifying a node of the digraph |
| Graph::Node | The base type of node iterators, or in other words, the trivial node iterator |
| Graph::NodeIt | This iterator goes through each node |
| Digraph::NodeIt | This iterator goes through each node |
| Digraph::NodeMap< T > | |
| Graph::NodeMap< T > | |
| MappableDigraphComponent< BAS >::NodeMap< V > | Standard graph map for the nodes |
| 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) |
| Orienter< GR, DM > | Adaptor class for orienting the edges of a graph to get a digraph |
| OrMap< M1, M2 > | Logical 'or' of two maps |
| Graph::OutArcIt | This iterator goes trough the outgoing directed arcs of a node |
| Digraph::OutArcIt | This iterator goes trough the outgoing arcs of a node |
| OutDegMap< GR > | Map of the out-degrees of nodes in a digraph |
| Palette | Map ints to different Colors |
| Path< GR > | A skeleton structure for representing directed paths in a digraph |
| Path< GR > | A 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 |
| Point< T > | Two dimensional vector (plain vector) |
| PotentialDifferenceMap< GR, POT > | Potential difference map |
| Preflow< GR, CAP, TR > | Preflow algorithm class |
| PreflowDefaultTraits< GR, CAP > | Default traits class of Preflow class |
| RadixHeap< IM > | A Radix Heap implementation |
| Random | Mersenne Twister random number generator |
| RangeIdMap< GR, K > | Provides continuous and unique ID for the items of a graph |
| 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::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 path arcs |
| 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 | |
| ScaleMap< M, C > | Scales a map with a constant |
| ScaleWriteMap< M, C > | Scales a map with a constant (read-write version) |
| SectionReader | Section reader class |
| SectionWriter | Section writer class |
| MinCostArborescence< GR, CM, TR >::SetArborescenceMap< T > | Named parameter for setting ArborescenceMap type |
| Dfs< GR, TR >::SetDistMap< T > | Named parameter for setting DistMap type |
| Dijkstra< GR, LEN, TR >::SetDistMap< T > | Named parameter for setting DistMap type |
| Bfs< GR, TR >::SetDistMap< T > | Named parameter for setting DistMap type |
| Preflow< GR, CAP, TR >::SetElevator< T > | Named parameter for setting Elevator type |
| Circulation< GR, LM, UM, SM, TR >::SetElevator< T > | Named parameter for setting Elevator type |
| Circulation< GR, LM, UM, SM, TR >::SetFlowMap< T > | Named parameter for setting FlowMap type |
| Preflow< GR, CAP, TR >::SetFlowMap< T > | Named parameter for setting FlowMap type |
| Dijkstra< GR, LEN, TR >::SetHeap< H, CR > | Named parameter for setting heap and cross reference types |
| Dijkstra< GR, LEN, TR >::SetOperationTraits< T > | Named parameter for setting OperationTraits type |
| MinCostArborescence< GR, CM, TR >::SetPredMap< T > | Named parameter for setting PredMap type |
| Bfs< GR, TR >::SetPredMap< T > | Named parameter for setting PredMap type |
| Dfs< GR, TR >::SetPredMap< T > | Named parameter for setting PredMap type |
| Dijkstra< GR, LEN, TR >::SetPredMap< T > | Named parameter for setting PredMap type |
| Bfs< GR, TR >::SetProcessedMap< T > | Named parameter for setting ProcessedMap type |
| Dfs< GR, TR >::SetProcessedMap< T > | Named parameter for setting ProcessedMap type |
| Dijkstra< GR, LEN, TR >::SetProcessedMap< T > | Named parameter for setting ProcessedMap type |
| BfsVisit< GR, VS, TR >::SetReachedMap< T > | |
| Dfs< GR, TR >::SetReachedMap< T > | Named parameter for setting ReachedMap type |
| DfsVisit< GR, VS, TR >::SetReachedMap< T > | |
| Bfs< GR, TR >::SetReachedMap< T > | Named parameter for setting ReachedMap type |
| Preflow< GR, CAP, TR >::SetStandardElevator< T > | Named parameter for setting Elevator type with automatic allocation |
| Circulation< GR, LM, UM, SM, TR >::SetStandardElevator< T > | Named parameter for setting Elevator type with automatic allocation |
| Dijkstra< GR, LEN, TR >::SetStandardHeap< H, CR > | Named parameter for setting heap and cross reference types with automatic allocation |
| Dijkstra< GR, LEN, TR >::SetStandardProcessedMap | Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> |
| Bfs< GR, TR >::SetStandardProcessedMap | Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> |
| Dfs< GR, TR >::SetStandardProcessedMap | Named 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) |
| SimpleBucketHeap< IM, MIN > | A Simplified Bucket Heap implementation |
| SimplePath< GR > | A structure for representing directed paths in a digraph |
| SkeletonSolverBase | A skeleton class to implement LP/MIP solver base interface |
| SmartArcSet< GR > | Digraph using a node set of another digraph or graph and an own arc set |
| SmartDigraph | A smart directed graph class |
| SmartDigraphBase | Base of SmartDigraph |
| SmartEdgeSet< GR > | Graph using a node set of another digraph or graph and an own edge set |
| SmartGraph | A smart undirected graph class |
| ListGraph::Snapshot | Class to make a snapshot of the graph and restore it later |
| SmartDigraph::Snapshot | Class to make a snapshot of the digraph and to restrore to it later |
| SmartGraph::Snapshot | Class to make a snapshot of the digraph and to restrore to it later |
| ListDigraph::Snapshot | Class to make a snapshot of the digraph and restore it later |
| SoplexLp | Interface for the SOPLEX solver |
| SourceMap< GR > | Map of the source nodes of arcs in a digraph |
| SparseMap< K, V, Comp > | Map type based on std::map |
| SplitNodes< DGR > | Adaptor class for splitting the nodes of a digraph |
| 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 |
| SubMap< M1, M2 > | Difference of two maps |
| Suurballe< GR, LEN > | Algorithm for finding arc-disjoint paths between two nodes having minimum total length |
| 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 |
| TrueMap< K > | Constant true map |
| RadixHeap< IM >::UnderFlowPriorityError | Exception thrown by RadixHeap |
| Undirector< DGR > | Adaptor class for viewing a digraph as an undirected graph |
| 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 >::ValueIterator | Forward iterator for values |
| WriteMap< K, T > | |
| XMap< M > | Map of x-coordinates of a Point-map |
| YMap< M > | Map of y-coordinates of a Point-map |
1.7.3
