All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages

Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 1234]

lemon | The namespace of LEMON |

concepts | The namespace of LEMON concepts and concept checking classes |

Digraph | Class describing the concept of directed graphs |

Arc | Class for identifying an arc of the digraph |

ArcIt | This iterator goes through each arc |

ArcMap | |

InArcIt | This iterator goes trough the incoming arcs of a node |

Node | Class for identifying a node of the digraph |

NodeIt | This iterator goes through each node |

NodeMap | |

OutArcIt | This iterator goes trough the outgoing arcs of a node |

Graph | Class describing the concept of Undirected Graphs |

Arc | The directed arc type |

ArcIt | This iterator goes through each directed arc |

ArcMap | |

Edge | |

EdgeIt | This iterator goes through each edge |

EdgeMap | |

InArcIt | This iterator goes trough the incoming directed arcs of a node |

IncEdgeIt | This iterator goes trough the incident undirected arcs of a node |

Node | The base type of node iterators, or in other words, the trivial node iterator |

NodeIt | This iterator goes through each node |

NodeMap | |

OutArcIt | This iterator goes trough the outgoing directed arcs of a node |

GraphItem | Concept class for `Node` , `Arc` and `Edge` types |

BaseDigraphComponent | Base skeleton class for directed graphs |

BaseGraphComponent | Base skeleton class for undirected graphs |

Edge | Undirected edge class of the graph |

IDableDigraphComponent | Skeleton class for idable directed graphs |

IDableGraphComponent | Skeleton class for idable undirected graphs |

GraphItemIt | Concept class for `NodeIt` , `ArcIt` and `EdgeIt` types |

GraphIncIt | Concept class for `InArcIt` , `OutArcIt` and `IncEdgeIt` types |

IterableDigraphComponent | Skeleton class for iterable directed graphs |

IterableGraphComponent | Skeleton class for iterable undirected graphs |

AlterableDigraphComponent | Skeleton class for alterable directed graphs |

AlterableGraphComponent | Skeleton class for alterable undirected 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 |

ExtendableDigraphComponent | Skeleton class for extendable directed graphs |

ExtendableGraphComponent | Skeleton class for extendable undirected graphs |

ErasableDigraphComponent | Skeleton class for erasable directed graphs |

ErasableGraphComponent | Skeleton class for erasable undirected graphs |

ClearableDigraphComponent | Skeleton class for clearable directed graphs |

ClearableGraphComponent | Skeleton class for clearable undirected graphs |

Heap | The heap concept |

ReadMap | |

WriteMap | |

ReadWriteMap | |

ReferenceMap | |

Path | A skeleton structure for representing directed paths in a digraph |

ArcIt | LEMON style iterator for path arcs |

PathDumper | A skeleton structure for path dumpers |

ArcIt | LEMON style iterator for path arcs |

RevArcIt | LEMON style iterator for path arcs |

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 | |

YMap | Map of y-coordinates of a `Point` -map |

ConstYMap | |

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 |

ArgParser | Command line arguments parser |

RefType | Magic type for operator[] |

BfsDefaultTraits | Default traits class of Bfs class |

Bfs | BFS algorithm class |

SetDistMap | Named parameter for setting `DistMap` type |

SetPredMap | Named parameter for setting `PredMap` type |

SetProcessedMap | Named parameter for setting `ProcessedMap` type |

SetReachedMap | Named parameter for setting `ReachedMap` type |

SetStandardProcessedMap | Named parameter for setting `ProcessedMap` type to be `Digraph::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 | |

BinHeap | A Binary Heap implementation |

BucketHeap | A Bucket Heap implementation |

SimpleBucketHeap | A Simplified Bucket Heap implementation |

CbcMip | Interface for the CBC MIP solver |

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 | |

Palette | Map `int` s to different `Color` s |

Invalid | Dummy type to make it easier to create invalid iterators |

DigraphCopy | Class to copy a digraph |

GraphCopy | Class to copy a 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 |

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 |

DfsDefaultTraits | Default traits class of Dfs class |

Dfs | DFS algorithm class |

SetDistMap | Named parameter for setting `DistMap` type |

SetPredMap | Named parameter for setting `PredMap` type |

SetProcessedMap | Named parameter for setting `ProcessedMap` type |

SetReachedMap | Named parameter for setting `ReachedMap` type |

SetStandardProcessedMap | Named parameter for setting `ProcessedMap` type to be `Digraph::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 | |

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 `DistMap` type |

SetHeap | Named parameter for setting heap and cross reference types |

SetOperationTraits | Named parameter for setting `OperationTraits` type |

SetPredMap | Named parameter for setting `PredMap` type |

SetProcessedMap | Named parameter for setting `ProcessedMap` type |

SetStandardHeap | Named parameter for setting heap and cross reference types with automatic allocation |

SetStandardProcessedMap | Named parameter for setting `ProcessedMap` type to be `Digraph::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 |

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 |

FullDigraph | A full digraph class |

FullGraph | An undirected full 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() |

GridGraph | Grid graph class |

ColMap | |

IndexMap | |

RowMap | |

HaoOrlin | Hao-Orlin algorithm for finding a minimum cut in a digraph |

HypercubeGraph | Hypercube graph class |

HyperMap | Linear combination map |

DigraphReader | LGF reader for directed graphs |

GraphReader | LGF reader for undirected graphs |

SectionReader | Section reader class |

LgfContents | Reader for the contents of the LGF file |

DigraphWriter | LGF writer for directed graphs |

GraphWriter | LGF writer for directed 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 |

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 |

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 `Value` type 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 `true` map |

FalseMap | Constant `false` map |

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 `true` assigned element |

IdMap | Provides an immutable and unique id for each item in a graph |

InverseMap | This class represents the inverse of its owner (IdMap) |

CrossRefMap | General cross reference graph map type |

InverseMap | The inverse map type |

ValueIterator | Forward iterator for values |

RangeIdMap | Provides continuous and unique ID for the items of a graph |

InverseMap | |

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 |

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 `ArborescenceMap` type |

SetPredMap | Named parameter for setting `PredMap` type |

NetworkSimplex | Implementation of the primal Network Simplex algorithm for finding a minimum cost flow |

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 |

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 |

RadixHeap | A Radix Heap implementation |

UnderFlowPriorityError | Exception thrown by RadixHeap |

Random | Mersenne Twister random number generator |

SmartDigraphBase | Base of SmartDigraph |

SmartDigraph | A smart directed graph class |

Snapshot | Class to make a snapshot of the digraph and to restrore to it later |

SmartGraph | A smart undirected graph class |

Snapshot | Class to make a snapshot of the digraph and to restrore to it later |

SoplexLp | Interface for the SOPLEX solver |

Suurballe | Algorithm for finding arc-disjoint paths between two nodes having minimum total length |

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 |

Generated on Sat Aug 10 2013 13:58:45 by 1.8.2