| The namespace of LEMON | |
| The namespace of LEMON concepts and concept checking classes | |
| Class describing the concept of undirected bipartite graphs | |
| The arc type of the graph | |
| Iterator class for the arcs | |
| Standard graph map type for the arcs | |
| Class to represent blue nodes | |
| Iterator class for the blue nodes | |
| Standard graph map type for the blue nodes | |
| The edge type of the graph | |
| Iterator class for the edges | |
| Standard graph map type for the edges | |
| Iterator class for the incoming arcs of a node | |
| Iterator class for the incident edges of a node | |
| The node type of the graph | |
| Iterator class for the nodes | |
| Standard graph map type for the nodes | |
| Iterator class for the outgoing arcs of a node | |
| Class to represent red nodes | |
| Iterator class for the red nodes | |
| Standard graph map type for the red nodes | |
| Class describing the concept of directed graphs | |
| The arc type of the digraph | |
| Iterator class for the arcs | |
| Standard graph map type for the arcs | |
| Iterator class for the incoming arcs of a node | |
| The node type of the digraph | |
| Iterator class for the nodes | |
| Standard graph map type for the nodes | |
| Iterator class for the outgoing arcs of a node | |
| Class describing the concept of undirected graphs | |
| The arc type of the graph | |
| Iterator class for the arcs | |
| Standard graph map type for the arcs | |
| The edge type of the graph | |
| Iterator class for the edges | |
| Standard graph map type for the edges | |
| Iterator class for the incoming arcs of a node | |
| Iterator class for the incident edges of a node | |
| The node type of the graph | |
| Iterator class for the nodes | |
| Standard graph map type for the nodes | |
| Iterator class for the outgoing arcs of a node | |
Concept class for Node, Arc and Edge types | |
| Base skeleton class for directed graphs | |
| Base skeleton class for undirected graphs | |
| Undirected edge class of the graph | |
| Base skeleton class for undirected bipartite graphs | |
| Class to represent blue nodes | |
| Class to represent red nodes | |
| Skeleton class for idable directed graphs | |
| Skeleton class for idable undirected graphs | |
| Skeleton class for idable undirected bipartite graphs | |
Concept class for NodeIt, ArcIt and EdgeIt types | |
Concept class for InArcIt, OutArcIt and IncEdgeIt types | |
| Skeleton class for iterable directed graphs | |
| Skeleton class for iterable undirected graphs | |
| Skeleton class for iterable undirected bipartite graphs | |
| Skeleton class for alterable directed graphs | |
| Skeleton class for alterable undirected graphs | |
| Skeleton class for alterable undirected bipartite graphs | |
| Concept class for standard graph maps | |
| Skeleton class for mappable directed graphs | |
| Standard graph map for the arcs | |
| Standard graph map for the nodes | |
| Skeleton class for mappable undirected graphs | |
| Standard graph map for the edges | |
| Skeleton class for mappable undirected bipartite graphs | |
| Standard graph map for the blue nodes | |
| Standard graph map for the red nodes | |
| Skeleton class for extendable directed graphs | |
| Skeleton class for extendable undirected graphs | |
| Skeleton class for extendable undirected bipartite graphs | |
| Skeleton class for erasable directed graphs | |
| Skeleton class for erasable undirected graphs | |
| Skeleton class for erasable undirected graphs | |
| Skeleton class for clearable directed graphs | |
| Skeleton class for clearable undirected graphs | |
| Skeleton class for clearable undirected biparite graphs | |
| The heap concept | |
| Readable map concept | |
| Writable map concept | |
| Read/writable map concept | |
| Dereferable map concept | |
| A skeleton structure for representing directed paths in a digraph | |
| LEMON style iterator for enumerating the arcs of a path | |
| A skeleton structure for path dumpers | |
| LEMON style iterator for enumerating the arcs of a path | |
| LEMON style iterator for enumerating the arcs of a path in reverse direction | |
| Tools for handling two dimensional coordinates | |
| Two dimensional vector (plain vector) | |
| Bounding box of plain vectors (points) | |
Map of x-coordinates of a Point-map | |
| Constant (read only) version of XMap | |
Map of y-coordinates of a Point-map | |
| Constant (read only) version of YMap | |
Map of the normSquare() of a Point-map | |
| Adaptor class for reversing the orientation of the arcs in a digraph | |
| Adaptor class for hiding nodes and arcs in a digraph | |
| Adaptor class for hiding nodes and edges in an undirected graph | |
| Adaptor class for hiding nodes in a digraph or a graph | |
| Adaptor class for hiding arcs in a digraph | |
| Adaptor class for hiding edges in a graph | |
| Adaptor class for viewing a digraph as an undirected graph | |
| Arc map combined from two original arc maps | |
| Adaptor class for orienting the edges of a graph to get a digraph | |
| Adaptor class for composing the residual digraph for directed flow and circulation problems | |
| Residual capacity map | |
| Adaptor class for splitting the nodes of a digraph | |
| Arc map combined from an arc map and a node map of the original digraph | |
| Node map combined from two original node maps | |
| Exception used by ArgParser | |
| Command line arguments parser | |
| Magic type for operator[] | |
| Default OperationTraits for the BellmanFord algorithm class | |
| Default traits class of BellmanFord class | |
| BellmanFord algorithm class | |
| LEMON iterator for getting the active nodes | |
Named parameter for setting DistMap type | |
Named parameter for setting OperationTraits type | |
Named parameter for setting PredMap type | |
| Default traits class of bellmanFord() function | |
| Default traits class used by BellmanFordWizard | |
| Auxiliary class for the function-type interface of the Bellman-Ford algorithm | |
| Default traits class of Bfs class | |
| BFS algorithm class | |
Named parameter for setting DistMap type | |
Named parameter for setting PredMap type | |
Named parameter for setting ProcessedMap type | |
Named parameter for setting ReachedMap type | |
Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> | |
| Default traits class of bfs() function | |
| Default traits class used by BfsWizard | |
| Auxiliary class for the function-type interface of BFS algorithm | |
| Visitor class for BFS | |
| Default traits class of BfsVisit class | |
| BFS algorithm class with visitor interface | |
| Named parameter for setting ReachedMap type | |
| Binary heap data structure | |
| Binomial heap data structure | |
| Bucket heap data structure | |
| Simplified bucket heap data structure | |
| Default traits class of CapacityScaling algorithm | |
| Implementation of the Capacity Scaling algorithm for finding a minimum cost flow | |
Named parameter for setting Heap type | |
| Interface for the CBC MIP solver | |
| Christofides algorithm for symmetric TSP | |
| Default traits class of Circulation class | |
| Push-relabel algorithm for the network circulation problem | |
| Named parameter for setting Elevator type | |
| Named parameter for setting FlowMap type | |
| Named parameter for setting Elevator type with automatic allocation | |
| Interface for the CLP solver | |
| Data structure representing RGB colors | |
Map ints to different Colors | |
| Dummy type to make it easier to create invalid iterators | |
| Class to copy a digraph | |
| Class to copy a graph | |
| Class to copy a bipartite graph | |
| Iterator for iterating on parallel arcs connecting the same nodes | |
| Iterator for iterating on parallel edges connecting the same nodes | |
| Dynamic arc look-up between given endpoints | |
| Fast arc look-up between given endpoints | |
| Fast look-up of all arcs between given endpoints | |
| Default traits class of CostScaling algorithm | |
| Implementation of the Cost Scaling algorithm for finding a minimum cost flow | |
Named parameter for setting LargeCost type | |
| A counter class | |
| 'Do nothing' version of Counter | |
| Reference counted wrapper around cpxenv pointer | |
| This exception is thrown when the license check is not sufficient | |
| Base interface for the CPLEX LP and MIP solver | |
| Interface for the CPLEX LP solver | |
| Interface for the CPLEX MIP solver | |
| Implementation of cycle-canceling algorithms for finding a minimum cost flow | |
| Default traits class of Dfs class | |
| DFS algorithm class | |
Named parameter for setting DistMap type | |
Named parameter for setting PredMap type | |
Named parameter for setting ProcessedMap type | |
Named parameter for setting ReachedMap type | |
Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> | |
| Default traits class of dfs() function | |
| Default traits class used by DfsWizard | |
| Auxiliary class for the function-type interface of DFS algorithm | |
| Visitor class for DFS | |
| Default traits class of DfsVisit class | |
| DFS algorithm class with visitor interface | |
| Named parameter for setting ReachedMap type | |
| D-ary heap data structure | |
| Default operation traits for the Dijkstra algorithm class | |
| Default traits class of Dijkstra class | |
| Dijkstra algorithm class | |
Named parameter for setting DistMap type | |
| Named parameter for setting heap and cross reference types | |
Named parameter for setting OperationTraits type | |
Named parameter for setting PredMap type | |
Named parameter for setting ProcessedMap type | |
| Named parameter for setting heap and cross reference types with automatic allocation | |
Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool> | |
| Default traits class of dijkstra() function | |
| Default traits class used by DijkstraWizard | |
| Auxiliary class for the function-type interface of Dijkstra algorithm | |
| DIMACS file type descriptor | |
| Digraph using a node set of another digraph or graph and an own arc set | |
| Graph using a node set of another digraph or graph and an own edge set | |
| Digraph using a node set of another digraph or graph and an own arc set | |
| Graph using a node set of another digraph or graph and an own edge set | |
| Default traits class of EdmondsKarp class | |
| Edmonds-Karp algorithms class | |
| Named parameter for setting FlowMap type | |
| Class for handling "labels" in push-relabel type algorithms | |
| Class for handling "labels" in push-relabel type algorithms | |
| Generic exception class | |
| Input-Output error | |
| Format error | |
| Euler tour iterator for digraphs | |
| Euler tour iterator for graphs | |
| Fibonacci heap data structure | |
| Default traits class of MaxFractionalMatching class | |
| Max cardinality fractional matching | |
| Named parameter for setting Elevator type | |
| Named parameter for setting MatchingMap type | |
| Named parameter for setting Elevator type with automatic allocation | |
| Weighted fractional matching in general graphs | |
| Weighted fractional perfect matching in general graphs | |
| A directed full graph class | |
| An undirected full graph class | |
| An undirected full bipartite graph class | |
| Base interface for the GLPK LP and MIP solver | |
| Interface for the GLPK LP solver | |
| Interface for the GLPK MIP solver | |
| Gomory-Hu cut tree algorithm | |
| Iterate on the edges of a minimum cut | |
| Iterate on the nodes of a minimum cut | |
| Default traits class of GraphToEps | |
| Auxiliary class to implement the named parameters of graphToEps() | |
| Greedy algorithm for symmetric TSP | |
| Grid graph class | |
| Map to get the column of the nodes | |
| Map to get the indices of the nodes as dim2::Point<int> | |
| Map to get the row of the nodes | |
| Implementation of the iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem | |
| Iterator to list the nodes of the found clique | |
| Hao-Orlin algorithm for finding a minimum cut in a digraph | |
| Default traits class of HartmannOrlinMmc class | |
| Implementation of the Hartmann-Orlin algorithm for finding a minimum mean cycle | |
Named parameter for setting LargeCost type | |
Named parameter for setting Path type | |
| Default traits class of HowardMmc class | |
| Implementation of Howard's algorithm for finding a minimum mean cycle | |
Named parameter for setting LargeCost type | |
Named parameter for setting Path type | |
| Hypercube graph class | |
| Linear combination map | |
| Insertion algorithm for symmetric TSP | |
| Default traits class of KarpMmc class | |
| Implementation of Karp's algorithm for finding a minimum mean cycle | |
Named parameter for setting LargeCost type | |
Named parameter for setting Path type | |
| LGF reader for directed graphs | |
| LGF reader for undirected graphs | |
| LGF reader for bipartite graphs | |
| Section reader class | |
| Reader for the contents of the LGF file | |
| LGF writer for directed graphs | |
| LGF writer for undirected graphs | |
| LGF writer for undirected bipartite graphs | |
| Section writer class | |
| A general directed graph structure | |
| Class to make a snapshot of the digraph and restore it later | |
| A general undirected graph structure | |
| Class to make a snapshot of the graph and restore it later | |
| A general undirected graph structure | |
| Class to make a snapshot of the graph and restore it later | |
| Common base class for LP and MIP solvers | |
| Refer to a column of the LP | |
| Iterator for iterate over the columns of an LP problem | |
| Linear constraint | |
| Linear expression of rows | |
| Iterator over the expression | |
| Iterator over the expression | |
| Linear expression of variables and a constant component | |
| Iterator over the expression | |
| Const iterator over the expression | |
| Refer to a row of the LP | |
| Iterator for iterate over the rows of an LP problem | |
| Unsupported file format exception | |
| Common base class for LP solvers | |
| Common base class for MIP solvers | |
| A skeleton class to implement LP/MIP solver base interface | |
| Skeleton class for an LP solver interface | |
| Skeleton class for a MIP solver interface | |
| Base class of maps | |
| Null map. (a.k.a. DoNothingMap) | |
| Constant map | |
| Constant map with inlined constant value | |
| Identity map | |
Map for storing values for integer keys from the range [0..size-1] | |
Map type based on std::map | |
| Composition of two maps | |
| Combination of two maps using an STL (binary) functor | |
| Converts an STL style (unary) functor to a map | |
| Converts a map to an STL style (unary) functor | |
Map adaptor to convert the Value type of a map to another type using the default conversion | |
| Applies all map setting operations to two maps | |
| Sum of two maps | |
| Difference of two maps | |
| Product of two maps | |
| Quotient of two maps | |
| Shifts a map with a constant | |
| Shifts a map with a constant (read-write version) | |
| Scales a map with a constant | |
| Scales a map with a constant (read-write version) | |
| Negative of a map | |
| Negative of a map (read-write version) | |
| Absolute value of a map | |
Constant true map | |
Constant false map | |
| Logical 'and' of two maps | |
| Logical 'or' of two maps | |
| Logical 'not' of a map | |
| Logical 'not' of a map (read-write version) | |
Combination of two maps using the == operator | |
Combination of two maps using the < operator | |
Writable bool map for logging each true assigned element | |
| Provides an immutable and unique id for each item in a graph | |
| The inverse map type of IdMap | |
| General cross reference graph map type | |
| The inverse map type of CrossRefMap | |
| Forward iterator for values | |
| Provides continuous and unique id for the items of a graph | |
| The inverse map type of RangeIdMap | |
Dynamic iterable bool map | |
Iterator for the keys mapped to false | |
| Iterator for the keys mapped to a given value | |
| Reference to the value of the map | |
Iterator for the keys mapped to true | |
| Dynamic iterable integer map | |
| Iterator for the keys with the same value | |
| Reference to the value of the map | |
| Dynamic iterable map for comparable values | |
| Iterator for the keys with the same value | |
| Forward iterator for values | |
| Map of the source nodes of arcs in a digraph | |
| Map of the target nodes of arcs in a digraph | |
| Map of the "forward" directed arc view of edges in a graph | |
| Map of the "backward" directed arc view of edges in a graph | |
| Map of the in-degrees of nodes in a digraph | |
| Map of the out-degrees of nodes in a digraph | |
| Potential difference map | |
| Maximum cardinality matching in general graphs | |
| Weighted matching in general graphs | |
| Iterator for obtaining the nodes of a blossom | |
| Weighted perfect matching in general graphs | |
| Iterator for obtaining the nodes of a blossom | |
| Default traits class of MaxCardinalitySearch class | |
| Maximum Cardinality Search algorithm class | |
| Named parameter for setting CapacityMap type | |
| Named parameter for setting CardinalityMap type | |
| Named parameter for setting heap and cross reference type | |
| Named parameter for setting ProcessedMap type | |
| Named parameter for setting heap and cross reference type with automatic allocation | |
| Default traits class for MinCostArborescence class | |
| Minimum Cost Arborescence algorithm class | |
| LEMON iterator for getting a dual variable | |
Named parameter for setting ArborescenceMap type | |
Named parameter for setting PredMap type | |
| Default traits class for NagamochiIbaraki class | |
| Calculates the minimum cut in an undirected graph | |
| Named parameter for setting heap and cross reference type | |
| Named parameter for setting heap and cross reference type with automatic allocation | |
| Named parameter for setting the capacity map to a constMap<Edge, int, 1>() instance | |
| Nearest neighbor algorithm for symmetric TSP | |
| Implementation of the primal Network Simplex algorithm for finding a minimum cost flow | |
| 2-opt algorithm for symmetric TSP | |
| Pairing Heap | |
| A structure for representing directed paths in a digraph | |
| LEMON style iterator for path arcs | |
| A structure for representing directed paths in a digraph | |
| Iterator class to iterate on the arcs of the paths | |
| A structure for representing directed paths in a digraph | |
| Iterator class to iterate on the arcs of the paths | |
| A structure for representing directed paths in a digraph | |
| Iterator class to iterate on the arcs of the paths | |
| Class which helps to iterate through the nodes of a path | |
| Planar embedding of an undirected simple graph | |
| Schnyder's planar drawing algorithm | |
| Coloring planar graphs | |
| Default traits class of Preflow class | |
| Preflow algorithm class | |
| Named parameter for setting Elevator type | |
| Named parameter for setting FlowMap type | |
| Named parameter for setting Elevator type with automatic allocation | |
| Fourary (quaternary) heap data structure | |
| Radix heap data structure | |
| Exception thrown by RadixHeap | |
| Mersenne Twister random number generator | |
| A smart directed graph class | |
| Class to make a snapshot of the digraph and to restore it later | |
| A smart undirected graph class | |
| Class to make a snapshot of the graph and to restore it later | |
| A smart undirected bipartite graph class | |
| Class to make a snapshot of the graph and to restore it later | |
| Interface for the SOPLEX solver | |
| A static directed graph class | |
| Default traits class of Suurballe algorithm | |
| Algorithm for finding arc-disjoint paths between two nodes having minimum total length | |
Named parameter for setting FlowMap type | |
Named parameter for setting Heap and HeapCrossRef types | |
Named parameter for setting Path type | |
Named parameter for setting PotentialMap type | |
| A class to store (cpu)time instances | |
| Class for measuring the cpu time and real time usage of the process | |
| Same as Timer but prints a report on destruction | |
| 'Do nothing' version of TimeReport | |
| A class to provide a basic way to handle the comparison of numbers that are obtained as a result of a probably inexact computation | |
| Float specialization of Tolerance | |
| Double specialization of Tolerance | |
| Long double specialization of Tolerance | |
| A Union-Find data structure implementation | |
| A Union-Find data structure implementation which is able to enumerate the components | |
| LEMON style iterator for the representant items | |
| LEMON style iterator for the items of a component | |
| A Extend-Find data structure implementation which is able to enumerate the components | |
| LEMON style iterator for the classes | |
| LEMON style iterator for the items of a component | |
| A Union-Find data structure implementation which is able to store a priority for each item and retrieve the minimum of each class | |
| Class iterator | |
| LEMON style iterator for the items of a class |
1.8.5