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